Base | Representation |
---|---|
bin | 10111011011010011000110… |
… | …111000001101011010011101 |
3 | 111111210200001101100202001001 |
4 | 113123103012320031122131 |
5 | 102001030003100321341 |
6 | 1003043443223350301 |
7 | 30462513346106113 |
oct | 2733230670153235 |
9 | 444720041322031 |
10 | 103031012120221 |
11 | 2a913230368879 |
12 | b6801255b2391 |
13 | 4564a2392ca33 |
14 | 1b62a28737ab3 |
15 | bda116914d31 |
hex | 5db4c6e0d69d |
103031012120221 has 2 divisors, whose sum is σ = 103031012120222. Its totient is φ = 103031012120220.
The previous prime is 103031012120219. The next prime is 103031012120279. The reversal of 103031012120221 is 122021210130301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83169639428121 + 19861372692100 = 9119739^2 + 4456610^2 .
It is a cyclic number.
It is not a de Polignac number, because 103031012120221 - 21 = 103031012120219 is a prime.
Together with 103031012120219, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103031012120291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51515506060110 + 51515506060111.
It is an arithmetic number, because the mean of its divisors is an integer number (51515506060111).
Almost surely, 2103031012120221 is an apocalyptic number.
It is an amenable number.
103031012120221 is a deficient number, since it is larger than the sum of its proper divisors (1).
103031012120221 is an equidigital number, since it uses as much as digits as its factorization.
103031012120221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 103031012120221 its reverse (122021210130301), we get a palindrome (225052222250522).
The spelling of 103031012120221 in words is "one hundred three trillion, thirty-one billion, twelve million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •