Base | Representation |
---|---|
bin | 10110111101111000111001… |
… | …110000111111011000010000 |
3 | 111020122110111021100012121112 |
4 | 112331320321300333120100 |
5 | 101214422000030324102 |
6 | 554455205154312452 |
7 | 30163506132450254 |
oct | 2675707160773020 |
9 | 436573437305545 |
10 | 101010010011152 |
11 | 2a204117364660 |
12 | b3b44bbb88728 |
13 | 44492841c58b8 |
14 | 1ad2ca6866264 |
15 | ba277ec20252 |
hex | 5bde39c3f610 |
101010010011152 has 80 divisors (see below), whose sum is σ = 222814963572480. Its totient is φ = 43938107136000.
The previous prime is 101010010011151. The next prime is 101010010011161. The reversal of 101010010011152 is 251110010010101.
It is not an unprimeable number, because it can be changed into a prime (101010010011151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 86991224 + ... + 88144727.
It is an arithmetic number, because the mean of its divisors is an integer number (2785187044656).
Almost surely, 2101010010011152 is an apocalyptic number.
It is an amenable number.
101010010011152 is an abundant number, since it is smaller than the sum of its proper divisors (121804953561328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101010010011152 is a wasteful number, since it uses less digits than its factorization.
101010010011152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175136112 (or 175136106 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 14.
Adding to 101010010011152 its reverse (251110010010101), we get a palindrome (352120020021253).
The spelling of 101010010011152 in words is "one hundred one trillion, ten billion, ten million, eleven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •