Base | Representation |
---|---|
bin | 1001010111100111000100… |
… | …1110100101000101100001 |
3 | 1100110210021111220220012102 |
4 | 2111321301032211011201 |
5 | 2322233410143120022 |
6 | 33524153103340145 |
7 | 2112145053446531 |
oct | 225716116450541 |
9 | 40423244826172 |
10 | 10301231223137 |
11 | 33118005224a8 |
12 | 11a45455b1655 |
13 | 59952c09121a |
14 | 2788219ab4c1 |
15 | 12ce5a758a92 |
hex | 95e713a5161 |
10301231223137 has 2 divisors, whose sum is σ = 10301231223138. Its totient is φ = 10301231223136.
The previous prime is 10301231223133. The next prime is 10301231223251. The reversal of 10301231223137 is 73132213210301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5524869054016 + 4776362169121 = 2350504^2 + 2185489^2 .
It is a cyclic number.
It is not a de Polignac number, because 10301231223137 - 22 = 10301231223133 is a prime.
It is a super-2 number, since 2×103012312231372 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10301231223133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5150615611568 + 5150615611569.
It is an arithmetic number, because the mean of its divisors is an integer number (5150615611569).
Almost surely, 210301231223137 is an apocalyptic number.
It is an amenable number.
10301231223137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10301231223137 is an equidigital number, since it uses as much as digits as its factorization.
10301231223137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 29.
Adding to 10301231223137 its reverse (73132213210301), we get a palindrome (83433444433438).
The spelling of 10301231223137 in words is "ten trillion, three hundred one billion, two hundred thirty-one million, two hundred twenty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •