Base | Representation |
---|---|
bin | 101011101011111011110… |
… | …100110100111001111100 |
3 | 101121222222100120011201120 |
4 | 223223323310310321330 |
5 | 343141311144231022 |
6 | 10215052401110540 |
7 | 426616064553642 |
oct | 53537364647174 |
9 | 11558870504646 |
10 | 3002112102012 |
11 | a58209020231 |
12 | 4059b5328450 |
13 | 18a1372972ca |
14 | a5435613192 |
15 | 53159d9bd5c |
hex | 2bafbd34e7c |
3002112102012 has 24 divisors (see below), whose sum is σ = 7119763128912. Its totient is φ = 984299049600.
The previous prime is 3002112102007. The next prime is 3002112102019. The reversal of 3002112102012 is 2102012112003.
It is a junction number, because it is equal to n+sod(n) for n = 3002112101982 and 3002112102000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3002112102019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2050622289 + ... + 2050623752.
It is an arithmetic number, because the mean of its divisors is an integer number (296656797038).
Almost surely, 23002112102012 is an apocalyptic number.
It is an amenable number.
3002112102012 is an abundant number, since it is smaller than the sum of its proper divisors (4117651026900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3002112102012 is a wasteful number, since it uses less digits than its factorization.
3002112102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4101246109 (or 4101246107 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 3002112102012 its reverse (2102012112003), we get a palindrome (5104124214015).
Subtracting from 3002112102012 its reverse (2102012112003), we obtain a palindrome (900099990009).
The spelling of 3002112102012 in words is "three trillion, two billion, one hundred twelve million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •