Base | Representation |
---|---|
bin | 1001011000010111011001… |
… | …1101111100101101000001 |
3 | 1100112000202121120021102002 |
4 | 2112011312131330231001 |
5 | 2322441442213240001 |
6 | 33534140244033345 |
7 | 2113114406540201 |
oct | 226056635745501 |
9 | 40460677507362 |
10 | 10314204040001 |
11 | 3317258320854 |
12 | 11a6b66092855 |
13 | 59a818936114 |
14 | 2792d289c401 |
15 | 12d4695db46b |
hex | 9617677cb41 |
10314204040001 has 2 divisors, whose sum is σ = 10314204040002. Its totient is φ = 10314204040000.
The previous prime is 10314204039983. The next prime is 10314204040051. The reversal of 10314204040001 is 10004040241301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9750480875776 + 563723164225 = 3122576^2 + 750815^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10314204040001 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10314204040051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5157102020000 + 5157102020001.
It is an arithmetic number, because the mean of its divisors is an integer number (5157102020001).
Almost surely, 210314204040001 is an apocalyptic number.
It is an amenable number.
10314204040001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10314204040001 is an equidigital number, since it uses as much as digits as its factorization.
10314204040001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 10314204040001 its reverse (10004040241301), we get a palindrome (20318244281302).
The spelling of 10314204040001 in words is "ten trillion, three hundred fourteen billion, two hundred four million, forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •