Base | Representation |
---|---|
bin | 11101011110111010110… |
… | …10110010010010011111 |
3 | 10120211210221121202021022 |
4 | 32233131122302102133 |
5 | 113044142204213043 |
6 | 2053214105354355 |
7 | 133121610532445 |
oct | 16573532622237 |
9 | 3524727552238 |
10 | 1013032101023 |
11 | 360696236318 |
12 | 1443ba4989bb |
13 | 746b41c9917 |
14 | 3706116ab95 |
15 | 1b540909868 |
hex | ebdd6b249f |
1013032101023 has 2 divisors, whose sum is σ = 1013032101024. Its totient is φ = 1013032101022.
The previous prime is 1013032101017. The next prime is 1013032101061. The reversal of 1013032101023 is 3201012303101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1013032101023 - 212 = 1013032096927 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1013032100992 and 1013032101010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013037101023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506516050511 + 506516050512.
It is an arithmetic number, because the mean of its divisors is an integer number (506516050512).
Almost surely, 21013032101023 is an apocalyptic number.
1013032101023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013032101023 is an equidigital number, since it uses as much as digits as its factorization.
1013032101023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1013032101023 its reverse (3201012303101), we get a palindrome (4214044404124).
The spelling of 1013032101023 in words is "one trillion, thirteen billion, thirty-two million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •