Base | Representation |
---|---|
bin | 101110101110100101001… |
… | …100100011010100000011 |
3 | 102100222102220221012000101 |
4 | 232232211030203110003 |
5 | 410102324144213443 |
6 | 10455055312303231 |
7 | 450665231336263 |
oct | 56564514432403 |
9 | 12328386835011 |
10 | 3211112101123 |
11 | 1028909081a23 |
12 | 43a402b41b17 |
13 | 1a3a64066234 |
14 | b15c0b097a3 |
15 | 587dd4ec84d |
hex | 2eba5323503 |
3211112101123 has 16 divisors (see below), whose sum is σ = 3374814960000. Its totient is φ = 3051322710912.
The previous prime is 3211112101117. The next prime is 3211112101133. The reversal of 3211112101123 is 3211012111123.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3211112101123 is a prime.
It is a super-2 number, since 2×32111121011232 (a number of 26 digits) contains 22 as substring.
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 3211112101123.
It is not an unprimeable number, because it can be changed into a prime (3211112101133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2937915 + ... + 3879892.
It is an arithmetic number, because the mean of its divisors is an integer number (210925935000).
Almost surely, 23211112101123 is an apocalyptic number.
3211112101123 is a deficient number, since it is larger than the sum of its proper divisors (163702858877).
3211112101123 is a wasteful number, since it uses less digits than its factorization.
3211112101123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6818094.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 3211112101123 its reverse (3211012111123), we get a palindrome (6422124212246).
The spelling of 3211112101123 in words is "three trillion, two hundred eleven billion, one hundred twelve million, one hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •