Base | Representation |
---|---|
bin | 111101100000110… |
… | …110110000111101 |
3 | 2122220221012112211 |
4 | 331200312300331 |
5 | 4103144214401 |
6 | 250223500421 |
7 | 34401023464 |
oct | 7540666075 |
9 | 2586835484 |
10 | 1032023101 |
11 | 48a60625a |
12 | 249757711 |
13 | 135a6cc75 |
14 | 9b0c59db |
15 | 60909951 |
hex | 3d836c3d |
1032023101 has 2 divisors, whose sum is σ = 1032023102. Its totient is φ = 1032023100.
The previous prime is 1032023089. The next prime is 1032023123. The reversal of 1032023101 is 1013202301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 996917476 + 35105625 = 31574^2 + 5925^2 .
It is an emirp because it is prime and its reverse (1013202301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1032023101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1032023401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516011550 + 516011551.
It is an arithmetic number, because the mean of its divisors is an integer number (516011551).
Almost surely, 21032023101 is an apocalyptic number.
It is an amenable number.
1032023101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032023101 is an equidigital number, since it uses as much as digits as its factorization.
1032023101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1032023101 is about 32125.1163577659. The cubic root of 1032023101 is about 1010.5624097046.
Adding to 1032023101 its reverse (1013202301), we get a palindrome (2045225402).
The spelling of 1032023101 in words is "one billion, thirty-two million, twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •