Base | Representation |
---|---|
bin | 11101011001010010101… |
… | …10001111110000000101 |
3 | 10120120000101220112101000 |
4 | 32230221112033300011 |
5 | 113022000304341401 |
6 | 2051554225123513 |
7 | 132654004644150 |
oct | 16545126176005 |
9 | 3516011815330 |
10 | 1010011012101 |
11 | 35a385981513 |
12 | 1438b6789599 |
13 | 74322340440 |
14 | 36c55c34c97 |
15 | 1b41559c186 |
hex | eb2958fc05 |
1010011012101 has 32 divisors (see below), whose sum is σ = 1841615525120. Its totient is φ = 532753060032.
The previous prime is 1010011012091. The next prime is 1010011012103. The reversal of 1010011012101 is 1012101100101.
1010011012101 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1010011012101 - 25 = 1010011012069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010011012103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 205534990 + ... + 205539903.
It is an arithmetic number, because the mean of its divisors is an integer number (57550485160).
Almost surely, 21010011012101 is an apocalyptic number.
It is an amenable number.
1010011012101 is a deficient number, since it is larger than the sum of its proper divisors (831604513019).
1010011012101 is a wasteful number, since it uses less digits than its factorization.
1010011012101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 411074922 (or 411074916 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1010011012101 its reverse (1012101100101), we get a palindrome (2022112112202).
The spelling of 1010011012101 in words is "one trillion, ten billion, eleven million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •