Base | Representation |
---|---|
bin | 11101001100010001011… |
… | …10010011100010110111 |
3 | 10112212222021101022012221 |
4 | 32212020232103202313 |
5 | 112413141413020043 |
6 | 2044440453423211 |
7 | 132315541461454 |
oct | 16461056234267 |
9 | 3485867338187 |
10 | 1003021220023 |
11 | 35741936a249 |
12 | 14248593ab07 |
13 | 7377a19c8b4 |
14 | 367917b482b |
15 | 1b156aec8ed |
hex | e988b938b7 |
1003021220023 has 2 divisors, whose sum is σ = 1003021220024. Its totient is φ = 1003021220022.
The previous prime is 1003021220011. The next prime is 1003021220039. The reversal of 1003021220023 is 3200221203001.
It is an a-pointer prime, because the next prime (1003021220039) can be obtained adding 1003021220023 to its sum of digits (16).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1003021220023 - 29 = 1003021219511 is a prime.
It is a super-2 number, since 2×10030212200232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1003021219979 and 1003021220006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1003021220423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501510610011 + 501510610012.
It is an arithmetic number, because the mean of its divisors is an integer number (501510610012).
Almost surely, 21003021220023 is an apocalyptic number.
1003021220023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1003021220023 is an equidigital number, since it uses as much as digits as its factorization.
1003021220023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 1003021220023 its reverse (3200221203001), we get a palindrome (4203242423024).
The spelling of 1003021220023 in words is "one trillion, three billion, twenty-one million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •