Base | Representation |
---|---|
bin | 10110111101111001110100… |
… | …110101010110011110110100 |
3 | 111020122120001100002011121021 |
4 | 112331321310311112132310 |
5 | 101214431012224310400 |
6 | 554455451355030524 |
7 | 30163542525012106 |
oct | 2675716465263664 |
9 | 436576040064537 |
10 | 101011001010100 |
11 | 2a20458579a855 |
12 | b3b4737a3b444 |
13 | 44493b1600acc |
14 | 1ad2d5c30d576 |
15 | ba27dbc2471a |
hex | 5bde74d567b4 |
101011001010100 has 72 divisors (see below), whose sum is σ = 221646861262400. Its totient is φ = 39954727802880.
The previous prime is 101011001010089. The next prime is 101011001010103. The reversal of 101011001010100 is 1010100110101.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101011001010103) 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 23 ways as a sum of consecutive naturals, for example, 12326637 + ... + 18814036.
Almost surely, 2101011001010100 is an apocalyptic number.
101011001010100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101011001010100 is an abundant number, since it is smaller than the sum of its proper divisors (120635860252300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011001010100 is a wasteful number, since it uses less digits than its factorization.
101011001010100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31141049 (or 31141042 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101011001010100 its reverse (1010100110101), we get a palindrome (102021101120201).
The spelling of 101011001010100 in words is "one hundred one trillion, eleven billion, one million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •