Base | Representation |
---|---|
bin | 100001100000010011110… |
… | …000110100000101011100 |
3 | 22011002222120211121200001 |
4 | 201200103300310011130 |
5 | 300210341103042022 |
6 | 4521420143544044 |
7 | 325226314243450 |
oct | 41402360640534 |
9 | 8132876747601 |
10 | 2302434034012 |
11 | 808502a95942 |
12 | 3122885bb024 |
13 | 139170736a98 |
14 | 7d61cd90660 |
15 | 3ed591d6b27 |
hex | 21813c3415c |
2302434034012 has 12 divisors (see below), whose sum is σ = 4604868068080. Its totient is φ = 986757443136.
The previous prime is 2302434034007. The next prime is 2302434034081. The reversal of 2302434034012 is 2104304342032.
2302434034012 is an admirable number.
It is a super-2 number, since 2×23024340340122 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 82229786929 = 2302434034012 / (2 + 3 + 0 + 2 + 4 + 3 + 4 + 0 + 3 + 4 + 0 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41114893437 + ... + 41114893492.
Almost surely, 22302434034012 is an apocalyptic number.
It is an amenable number.
2302434034012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2302434034012 is a wasteful number, since it uses less digits than its factorization.
2302434034012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82229786940 (or 82229786938 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 2302434034012 its reverse (2104304342032), we get a palindrome (4406738376044).
The spelling of 2302434034012 in words is "two trillion, three hundred two billion, four hundred thirty-four million, thirty-four thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •