Base | Representation |
---|---|
bin | 10110111111101010101101… |
… | …011101011010010101100000 |
3 | 111021002010220121101221010001 |
4 | 112333222231131122111200 |
5 | 101223422231242320112 |
6 | 555031255042545344 |
7 | 30205363305314260 |
oct | 2677525535322540 |
9 | 437063817357101 |
10 | 101132210120032 |
11 | 2a250a25113083 |
12 | b414124668254 |
13 | 445795a14c030 |
14 | 1ad8b7a0777a0 |
15 | ba5a32e14c57 |
hex | 5bfaad75a560 |
101132210120032 has 48 divisors (see below), whose sum is σ = 245051124528672. Its totient is φ = 40008346859520.
The previous prime is 101132210120023. The next prime is 101132210120069. The reversal of 101132210120032 is 230021012231101.
It is a junction number, because it is equal to n+sod(n) for n = 101132210119991 and 101132210120009.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17364730969 + ... + 17364736792.
It is an arithmetic number, because the mean of its divisors is an integer number (5105231761014).
Almost surely, 2101132210120032 is an apocalyptic number.
It is an amenable number.
101132210120032 is an abundant number, since it is smaller than the sum of its proper divisors (143918914408640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101132210120032 is a wasteful number, since it uses less digits than its factorization.
101132210120032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34729467791 (or 34729467783 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 101132210120032 its reverse (230021012231101), we get a palindrome (331153222351133).
The spelling of 101132210120032 in words is "one hundred one trillion, one hundred thirty-two billion, two hundred ten million, one hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •