Base | Representation |
---|---|
bin | 11101010010000110011… |
… | …111100000100100001011 |
3 | 21010101002201112112200101 |
4 | 131102012133200210023 |
5 | 230432143040220243 |
6 | 4140234404150231 |
7 | 265245461066152 |
oct | 35220637404413 |
9 | 7111081475611 |
10 | 2012301101323 |
11 | 706459569327 |
12 | 285bb7698377 |
13 | 1179b3bc1056 |
14 | 6d57848a599 |
15 | 37527dc854d |
hex | 1d4867e090b |
2012301101323 has 8 divisors (see below), whose sum is σ = 2130753122640. Its totient is φ = 1893858120960.
The previous prime is 2012301101269. The next prime is 2012301101329. The reversal of 2012301101323 is 3231011032102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2012301101323 - 233 = 2003711166731 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2012301101323.
It is not an unprimeable number, because it can be changed into a prime (2012301101329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1799298 + ... + 2694823.
It is an arithmetic number, because the mean of its divisors is an integer number (266344140330).
Almost surely, 22012301101323 is an apocalyptic number.
2012301101323 is a deficient number, since it is larger than the sum of its proper divisors (118452021317).
2012301101323 is a wasteful number, since it uses less digits than its factorization.
2012301101323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4520477.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 2012301101323 its reverse (3231011032102), we get a palindrome (5243312133425).
The spelling of 2012301101323 in words is "two trillion, twelve billion, three hundred one million, one hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •