Base | Representation |
---|---|
bin | 1001001100001001001000… |
… | …0001110000001011101111 |
3 | 1022202221201222101211202011 |
4 | 2103002102001300023233 |
5 | 2311021412012410411 |
6 | 33253451131342051 |
7 | 2062001550343231 |
oct | 223022201601357 |
9 | 38687658354664 |
10 | 10104213013231 |
11 | 3246199914337 |
12 | 11723205b1927 |
13 | 583a9174bbac |
14 | 26d091912251 |
15 | 127c78e7cc21 |
hex | 930920702ef |
10104213013231 has 2 divisors, whose sum is σ = 10104213013232. Its totient is φ = 10104213013230.
The previous prime is 10104213013229. The next prime is 10104213013241. The reversal of 10104213013231 is 13231031240101.
It is a weak prime.
It is an emirp because it is prime and its reverse (13231031240101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10104213013231 - 21 = 10104213013229 is a prime.
It is a super-2 number, since 2×101042130132312 (a number of 27 digits) contains 22 as substring.
Together with 10104213013229, 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 (10104213013241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5052106506615 + 5052106506616.
It is an arithmetic number, because the mean of its divisors is an integer number (5052106506616).
Almost surely, 210104213013231 is an apocalyptic number.
10104213013231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10104213013231 is an equidigital number, since it uses as much as digits as its factorization.
10104213013231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10104213013231 its reverse (13231031240101), we get a palindrome (23335244253332).
The spelling of 10104213013231 in words is "ten trillion, one hundred four billion, two hundred thirteen million, thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •