Base | Representation |
---|---|
bin | 100110100101111110001… |
… | …001110011001111001100 |
3 | 100101112120012100020122122 |
4 | 212211332021303033030 |
5 | 321423010444220022 |
6 | 5350210233432112 |
7 | 362415535160540 |
oct | 46457611631714 |
9 | 10345505306578 |
10 | 2652111320012 |
11 | 932832777400 |
12 | 369bb686b638 |
13 | 1631294b3a7b |
14 | 92511a19a20 |
15 | 48ec2c41742 |
hex | 2697e2733cc |
2652111320012 has 72 divisors (see below), whose sum is σ = 6173217927072. Its totient is φ = 972508331520.
The previous prime is 2652111320011. The next prime is 2652111320017. The reversal of 2652111320012 is 2100231112562.
It is not an unprimeable number, because it can be changed into a prime (2652111320011) 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 in 23 ways as a sum of consecutive naturals, for example, 22965803 + ... + 23080994.
It is an arithmetic number, because the mean of its divisors is an integer number (85739137876).
Almost surely, 22652111320012 is an apocalyptic number.
2652111320012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2652111320012 is an abundant number, since it is smaller than the sum of its proper divisors (3521106607060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2652111320012 is a wasteful number, since it uses less digits than its factorization.
2652111320012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46046847 (or 46046834 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 2652111320012 its reverse (2100231112562), we get a palindrome (4752342432574).
The spelling of 2652111320012 in words is "two trillion, six hundred fifty-two billion, one hundred eleven million, three hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •