Base | Representation |
---|---|
bin | 10110111111010110000010… |
… | …111100100001101110101100 |
3 | 111021000000122021120122220211 |
4 | 112333112002330201232230 |
5 | 101223041311114120022 |
6 | 555013145230552204 |
7 | 30203646413503105 |
oct | 2677260274415654 |
9 | 437000567518824 |
10 | 101110022020012 |
11 | 2a242579552135 |
12 | b40b971968664 |
13 | 445583234b375 |
14 | 1ad7a733313ac |
15 | ba518502ce77 |
hex | 5bf582f21bac |
101110022020012 has 24 divisors (see below), whose sum is σ = 177151072578480. Its totient is φ = 50495431234560.
The previous prime is 101110022019967. The next prime is 101110022020013. The reversal of 101110022020012 is 210020220011101.
101110022020012 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 101110022019974 and 101110022020001.
It is not an unprimeable number, because it can be changed into a prime (101110022020013) 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, 554425539 + ... + 554607877.
It is an arithmetic number, because the mean of its divisors is an integer number (7381294690770).
Almost surely, 2101110022020012 is an apocalyptic number.
It is an amenable number.
101110022020012 is a deficient number, since it is larger than the sum of its proper divisors (76041050558468).
101110022020012 is a wasteful number, since it uses less digits than its factorization.
101110022020012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 344961 (or 344959 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101110022020012 its reverse (210020220011101), we get a palindrome (311130242031113).
The spelling of 101110022020012 in words is "one hundred one trillion, one hundred ten billion, twenty-two million, twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •