Base | Representation |
---|---|
bin | 1110001001001010101100… |
… | …00100000101010010000010 |
3 | 11002010020220012220010011100 |
4 | 13010211112010011102002 |
5 | 13034030431314213442 |
6 | 150051424013155230 |
7 | 6356665154655021 |
oct | 704452604052202 |
9 | 132106805803140 |
10 | 31101302101122 |
11 | 9a00a96254980 |
12 | 35a378318bb16 |
13 | 1447abcc09956 |
14 | 79744d7608b8 |
15 | 38e039c3284c |
hex | 1c4956105482 |
31101302101122 has 48 divisors (see below), whose sum is σ = 73518650187840. Its totient is φ = 9423806028000.
The previous prime is 31101302101061. The next prime is 31101302101229. The reversal of 31101302101122 is 22110120310113.
31101302101122 is a `hidden beast` number, since 311 + 0 + 1 + 30 + 210 + 112 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 31101302101095 and 31101302101104.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4671597 + ... + 9166592.
It is an arithmetic number, because the mean of its divisors is an integer number (1531638545580).
Almost surely, 231101302101122 is an apocalyptic number.
31101302101122 is an abundant number, since it is smaller than the sum of its proper divisors (42417348086718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31101302101122 is a wasteful number, since it uses less digits than its factorization.
31101302101122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13849559 (or 13849556 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 31101302101122 its reverse (22110120310113), we get a palindrome (53211422411235).
The spelling of 31101302101122 in words is "thirty-one trillion, one hundred one billion, three hundred two million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.471 sec. • engine limits •