Base | Representation |
---|---|
bin | 10111000010100011000001… |
… | …111000010011100101101111 |
3 | 111021210001202101001000001111 |
4 | 113002203001320103211233 |
5 | 101240143042012211343 |
6 | 555302225352252451 |
7 | 30225600602654233 |
oct | 2702430170234557 |
9 | 437701671030044 |
10 | 101330121210223 |
11 | 2a317954830434 |
12 | b4465586a1127 |
13 | 447050a7641a9 |
14 | 1b045929585c3 |
15 | baac67cb2c9d |
hex | 5c28c1e1396f |
101330121210223 has 2 divisors, whose sum is σ = 101330121210224. Its totient is φ = 101330121210222.
The previous prime is 101330121210191. The next prime is 101330121210239. The reversal of 101330121210223 is 322012121033101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101330121210223 - 25 = 101330121210191 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101330121210194 and 101330121210203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101330121211223) 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, 50665060605111 + 50665060605112.
It is an arithmetic number, because the mean of its divisors is an integer number (50665060605112).
Almost surely, 2101330121210223 is an apocalyptic number.
101330121210223 is a deficient number, since it is larger than the sum of its proper divisors (1).
101330121210223 is an equidigital number, since it uses as much as digits as its factorization.
101330121210223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 101330121210223 its reverse (322012121033101), we get a palindrome (423342242243324).
The spelling of 101330121210223 in words is "one hundred one trillion, three hundred thirty billion, one hundred twenty-one million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •