Base | Representation |
---|---|
bin | 10110111111110011011001… |
… | …000011000101010010001000 |
3 | 111021010000222012221111000020 |
4 | 112333303121003011102020 |
5 | 101224100324011201102 |
6 | 555035440021140440 |
7 | 30206143301416266 |
oct | 2677633103052210 |
9 | 437100865844006 |
10 | 101141531350152 |
11 | 2a254978769247 |
12 | b415aa625a720 |
13 | 44587b4321407 |
14 | 1ad93c1dcb436 |
15 | ba5dcb3e5bbc |
hex | 5bfcd90c5488 |
101141531350152 has 32 divisors (see below), whose sum is σ = 252854159453280. Its totient is φ = 33713799639680.
The previous prime is 101141531350141. The next prime is 101141531350187. The reversal of 101141531350152 is 251053135141101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19675252 + ... + 24277532.
It is an arithmetic number, because the mean of its divisors is an integer number (7901692482915).
Almost surely, 2101141531350152 is an apocalyptic number.
101141531350152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101141531350152 is an abundant number, since it is smaller than the sum of its proper divisors (151712628103128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101141531350152 is a wasteful number, since it uses less digits than its factorization.
101141531350152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5517973 (or 5517969 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 33.
Adding to 101141531350152 its reverse (251053135141101), we get a palindrome (352194666491253).
The spelling of 101141531350152 in words is "one hundred one trillion, one hundred forty-one billion, five hundred thirty-one million, three hundred fifty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •