Base | Representation |
---|---|
bin | 10110111101101111110010… |
… | …010011101000111011110111 |
3 | 111020121112020001222002021202 |
4 | 112331233302103220323313 |
5 | 101214241423111400434 |
6 | 554450505554203115 |
7 | 30163011431103503 |
oct | 2675576223507367 |
9 | 436545201862252 |
10 | 101000221200119 |
11 | 2a1aaa53884a8a |
12 | b3b262988349b |
13 | 44483841ac517 |
14 | 1ad2618799303 |
15 | ba23aa67ba7e |
hex | 5bdbf24e8ef7 |
101000221200119 has 2 divisors, whose sum is σ = 101000221200120. Its totient is φ = 101000221200118.
The previous prime is 101000221200101. The next prime is 101000221200133. The reversal of 101000221200119 is 911002122000101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101000221200119 - 28 = 101000221199863 is a prime.
It is a super-2 number, since 2×1010002212001192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101000221200119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101000221200139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500110600059 + 50500110600060.
It is an arithmetic number, because the mean of its divisors is an integer number (50500110600060).
Almost surely, 2101000221200119 is an apocalyptic number.
101000221200119 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000221200119 is an equidigital number, since it uses as much as digits as its factorization.
101000221200119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 101000221200119 in words is "one hundred one trillion, two hundred twenty-one million, two hundred thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •