Base | Representation |
---|---|
bin | 10111011100101111100110… |
… | …001010010101001001100001 |
3 | 111112011011101101221022101102 |
4 | 113130233212022111021201 |
5 | 102004141344212241001 |
6 | 1003201225430044145 |
7 | 30502630333340666 |
oct | 2734574612251141 |
9 | 445134341838342 |
10 | 103130321212001 |
11 | 2a9513617a4346 |
12 | b69741baa9655 |
13 | 45711bc264435 |
14 | 1b67769b09a6d |
15 | bdc9ca175e6b |
hex | 5dcbe6295261 |
103130321212001 has 2 divisors, whose sum is σ = 103130321212002. Its totient is φ = 103130321212000.
The previous prime is 103130321211997. The next prime is 103130321212049. The reversal of 103130321212001 is 100212123031301.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98566693061776 + 4563628150225 = 9928076^2 + 2136265^2 .
It is a cyclic number.
It is not a de Polignac number, because 103130321212001 - 22 = 103130321211997 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 (103130321212091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51565160606000 + 51565160606001.
It is an arithmetic number, because the mean of its divisors is an integer number (51565160606001).
Almost surely, 2103130321212001 is an apocalyptic number.
It is an amenable number.
103130321212001 is a deficient number, since it is larger than the sum of its proper divisors (1).
103130321212001 is an equidigital number, since it uses as much as digits as its factorization.
103130321212001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 103130321212001 its reverse (100212123031301), we get a palindrome (203342444243302).
The spelling of 103130321212001 in words is "one hundred three trillion, one hundred thirty billion, three hundred twenty-one million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •