Base | Representation |
---|---|
bin | 10111001111011001011110… |
… | …010100000000011001000111 |
3 | 111101220111011121221110212001 |
4 | 113033121132110000121013 |
5 | 101344130130241403444 |
6 | 1001220034032010131 |
7 | 30346442504641465 |
oct | 2717313624003107 |
9 | 441814147843761 |
10 | 102213214012999 |
11 | 2a628420687761 |
12 | b569732690947 |
13 | 450588452078b |
14 | 1b352086db835 |
15 | bc3c00d498d4 |
hex | 5cf65e500647 |
102213214012999 has 2 divisors, whose sum is σ = 102213214013000. Its totient is φ = 102213214012998.
The previous prime is 102213214012997. The next prime is 102213214013003. The reversal of 102213214012999 is 999210412312201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102213214012999 - 21 = 102213214012997 is a prime.
It is a super-2 number, since 2×1022132140129992 (a number of 29 digits) contains 22 as substring.
Together with 102213214012997, 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 (102213214012997) 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, 51106607006499 + 51106607006500.
It is an arithmetic number, because the mean of its divisors is an integer number (51106607006500).
Almost surely, 2102213214012999 is an apocalyptic number.
102213214012999 is a deficient number, since it is larger than the sum of its proper divisors (1).
102213214012999 is an equidigital number, since it uses as much as digits as its factorization.
102213214012999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 46.
The spelling of 102213214012999 in words is "one hundred two trillion, two hundred thirteen billion, two hundred fourteen million, twelve thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •