Base | Representation |
---|---|
bin | 111100010000110… |
… | …010000000100101 |
3 | 2121110102202022101 |
4 | 330100302000211 |
5 | 4032311011401 |
6 | 244153532101 |
7 | 34024426312 |
oct | 7420620045 |
9 | 2543382271 |
10 | 1011032101 |
11 | 479779422 |
12 | 242714031 |
13 | 131600761 |
14 | 983bdd09 |
15 | 5db60101 |
hex | 3c432025 |
1011032101 has 2 divisors, whose sum is σ = 1011032102. Its totient is φ = 1011032100.
The previous prime is 1011032093. The next prime is 1011032111. The reversal of 1011032101 is 1012301101.
It is an a-pointer prime, because the next prime (1011032111) can be obtained adding 1011032101 to its sum of digits (10).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 747749025 + 263283076 = 27345^2 + 16226^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011032101 - 23 = 1011032093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011032111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505516050 + 505516051.
It is an arithmetic number, because the mean of its divisors is an integer number (505516051).
Almost surely, 21011032101 is an apocalyptic number.
It is an amenable number.
1011032101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011032101 is an equidigital number, since it uses as much as digits as its factorization.
1011032101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 1011032101 is about 31796.7309797721. The cubic root of 1011032101 is about 1003.6639262492.
Adding to 1011032101 its reverse (1012301101), we get a palindrome (2023333202).
The spelling of 1011032101 in words is "one billion, eleven million, thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •