Base | Representation |
---|---|
bin | 101111000010010011… |
… | …1011111000000010001 |
3 | 100122201111121112221112 |
4 | 1132010213133000101 |
5 | 3123331323102204 |
6 | 114223013303105 |
7 | 10204046646053 |
oct | 1360447370021 |
9 | 318644545845 |
10 | 101009190929 |
11 | 39924067199 |
12 | 176ab934a95 |
13 | 96a991713a |
14 | 4c630c18d3 |
15 | 2962b3426e |
hex | 17849df011 |
101009190929 has 2 divisors, whose sum is σ = 101009190930. Its totient is φ = 101009190928.
The previous prime is 101009190883. The next prime is 101009190937. The reversal of 101009190929 is 929091900101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63429429904 + 37579761025 = 251852^2 + 193855^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101009190929 is a prime.
It is a super-4 number, since 4×1010091909294 (a number of 45 digits) contains 4444 as substring.
It is not a weakly prime, because it can be changed into another prime (101009190959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50504595464 + 50504595465.
It is an arithmetic number, because the mean of its divisors is an integer number (50504595465).
Almost surely, 2101009190929 is an apocalyptic number.
It is an amenable number.
101009190929 is a deficient number, since it is larger than the sum of its proper divisors (1).
101009190929 is an equidigital number, since it uses as much as digits as its factorization.
101009190929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13122, while the sum is 41.
It can be divided in two parts, 10100 and 9190929, that added together give a palindrome (9201029).
The spelling of 101009190929 in words is "one hundred one billion, nine million, one hundred ninety thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •