Base | Representation |
---|---|
bin | 101110100100100110… |
… | …0010100001110011111 |
3 | 100120011000121211112122 |
4 | 1131021030110032133 |
5 | 3114311111310101 |
6 | 113540040453155 |
7 | 10140252533234 |
oct | 1351114241637 |
9 | 316130554478 |
10 | 100012213151 |
11 | 39462318014 |
12 | 17471a7a1bb |
13 | 957b1c7766 |
14 | 4baa91d78b |
15 | 290534d51b |
hex | 174931439f |
100012213151 has 2 divisors, whose sum is σ = 100012213152. Its totient is φ = 100012213150.
The previous prime is 100012213057. The next prime is 100012213157. The reversal of 100012213151 is 151312210001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100012213151 is a prime.
It is a super-2 number, since 2×1000122131512 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100012213157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50006106575 + 50006106576.
It is an arithmetic number, because the mean of its divisors is an integer number (50006106576).
Almost surely, 2100012213151 is an apocalyptic number.
100012213151 is a deficient number, since it is larger than the sum of its proper divisors (1).
100012213151 is an equidigital number, since it uses as much as digits as its factorization.
100012213151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 100012213151 its reverse (151312210001), we get a palindrome (251324423152).
The spelling of 100012213151 in words is "one hundred billion, twelve million, two hundred thirteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •