Base | Representation |
---|---|
bin | 101101000111001100011… |
… | …011100111001110000100 |
3 | 101222100220101100200002211 |
4 | 231013030123213032010 |
5 | 401243001402223022 |
6 | 10332100011513204 |
7 | 436655253340321 |
oct | 55071433471604 |
9 | 11870811320084 |
10 | 3100101211012 |
11 | a95822350143 |
12 | 4209a1758804 |
13 | 1964522b8400 |
14 | aa08d581b48 |
15 | 559927c1e77 |
hex | 2d1cc6e7384 |
3100101211012 has 36 divisors (see below), whose sum is σ = 5920856933376. Its totient is φ = 1419549636960.
The previous prime is 3100101211007. The next prime is 3100101211013. The reversal of 3100101211012 is 2101121010013.
It is a happy number.
3100101211012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×31001012110122 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 3100101210983 and 3100101211001.
It is not an unprimeable number, because it can be changed into a prime (3100101211013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17969064 + ... + 18140767.
Almost surely, 23100101211012 is an apocalyptic number.
It is an amenable number.
3100101211012 is a deficient number, since it is larger than the sum of its proper divisors (2820755722364).
3100101211012 is a wasteful number, since it uses less digits than its factorization.
3100101211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36109988 (or 36109973 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 3100101211012 its reverse (2101121010013), we get a palindrome (5201222221025).
The spelling of 3100101211012 in words is "three trillion, one hundred billion, one hundred one million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •