Base | Representation |
---|---|
bin | 10110111111011000110100… |
… | …101001001111101111111000 |
3 | 111021000022100001101220001012 |
4 | 112333120310221033233320 |
5 | 101223113412321410242 |
6 | 555014401130213052 |
7 | 30204113324161625 |
oct | 2677306451175770 |
9 | 437008301356035 |
10 | 101113003310072 |
11 | 2a2438693a3516 |
12 | b410464284188 |
13 | 4455bb8bb1720 |
14 | 1ad7c7726734c |
15 | ba52abb28282 |
hex | 5bf634a4fbf8 |
101113003310072 has 32 divisors (see below), whose sum is σ = 204494054126880. Its totient is φ = 46593581892480.
The previous prime is 101113003310071. The next prime is 101113003310113. The reversal of 101113003310072 is 270013300311101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101113003310071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 770330903 + ... + 770462150.
It is an arithmetic number, because the mean of its divisors is an integer number (6390439191465).
Almost surely, 2101113003310072 is an apocalyptic number.
It is an amenable number.
101113003310072 is an abundant number, since it is smaller than the sum of its proper divisors (103381050816808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101113003310072 is a wasteful number, since it uses less digits than its factorization.
101113003310072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1540793703 (or 1540793699 counting only the distinct ones).
The product of its (nonzero) digits is 378, while the sum is 23.
Adding to 101113003310072 its reverse (270013300311101), we get a palindrome (371126303621173).
The spelling of 101113003310072 in words is "one hundred one trillion, one hundred thirteen billion, three million, three hundred ten thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •