Base | Representation |
---|---|
bin | 1100001110011011010… |
… | …0110011011111101101 |
3 | 202002010102102220221021 |
4 | 3003212310303133231 |
5 | 11420120421013201 |
6 | 240253101534141 |
7 | 21113523214066 |
oct | 3034664633755 |
9 | 662112386837 |
10 | 210031032301 |
11 | 8108a051242 |
12 | 34856b74351 |
13 | 16a6258344c |
14 | a24640156d |
15 | 56e3e11ea1 |
hex | 30e6d337ed |
210031032301 has 2 divisors, whose sum is σ = 210031032302. Its totient is φ = 210031032300.
The previous prime is 210031032293. The next prime is 210031032311. The reversal of 210031032301 is 103230130012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 208254409801 + 1776622500 = 456349^2 + 42150^2 .
It is a cyclic number.
It is not a de Polignac number, because 210031032301 - 23 = 210031032293 is a prime.
It is a super-2 number, since 2×2100310323012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210031032311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105015516150 + 105015516151.
It is an arithmetic number, because the mean of its divisors is an integer number (105015516151).
Almost surely, 2210031032301 is an apocalyptic number.
It is an amenable number.
210031032301 is a deficient number, since it is larger than the sum of its proper divisors (1).
210031032301 is an equidigital number, since it uses as much as digits as its factorization.
210031032301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 210031032301 its reverse (103230130012), we get a palindrome (313261162313).
The spelling of 210031032301 in words is "two hundred ten billion, thirty-one million, thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •