Base | Representation |
---|---|
bin | 10001011101100110001… |
… | …010111010000110001111 |
3 | 11020201102202112201112002 |
4 | 101131212022322012033 |
5 | 124130110030323043 |
6 | 2315135455102515 |
7 | 152461236536465 |
oct | 21354612720617 |
9 | 4221382481462 |
10 | 1200010011023 |
11 | 422a1540456a |
12 | 1746a0b11a3b |
13 | 892116b15a5 |
14 | 4211b9b2835 |
15 | 21335a16bb8 |
hex | 117662ba18f |
1200010011023 has 2 divisors, whose sum is σ = 1200010011024. Its totient is φ = 1200010011022.
The previous prime is 1200010011001. The next prime is 1200010011029. The reversal of 1200010011023 is 3201100100021.
It is a strong prime.
It is an emirp because it is prime and its reverse (3201100100021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1200010011023 - 28 = 1200010010767 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1200010010995 and 1200010011013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1200010011029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600005005511 + 600005005512.
It is an arithmetic number, because the mean of its divisors is an integer number (600005005512).
Almost surely, 21200010011023 is an apocalyptic number.
1200010011023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200010011023 is an equidigital number, since it uses as much as digits as its factorization.
1200010011023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1200010011023 its reverse (3201100100021), we get a palindrome (4401110111044).
The spelling of 1200010011023 in words is "one trillion, two hundred billion, ten million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •