Base | Representation |
---|---|
bin | 1001001011111001100110… |
… | …0011000000000000110001 |
3 | 1022202112222110001021212102 |
4 | 2102332121203000000301 |
5 | 2310434342303431113 |
6 | 33251521331310145 |
7 | 2061463340131562 |
oct | 222763143000061 |
9 | 38675873037772 |
10 | 10100044202033 |
11 | 324444a70a825 |
12 | 117155844b355 |
13 | 583578b732c6 |
14 | 26cbb7db8169 |
15 | 127ad2eae758 |
hex | 92f998c0031 |
10100044202033 has 16 divisors (see below), whose sum is σ = 10767249682560. Its totient is φ = 9456949084800.
The previous prime is 10100044201999. The next prime is 10100044202057. The reversal of 10100044202033 is 33020244000101.
It is a cyclic number.
It is not a de Polignac number, because 10100044202033 - 218 = 10100043939889 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10100044201996 and 10100044202014.
It is not an unprimeable number, because it can be changed into a prime (10100044202093) 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 in 15 ways as a sum of consecutive naturals, for example, 25234283 + ... + 25631408.
It is an arithmetic number, because the mean of its divisors is an integer number (672953105160).
Almost surely, 210100044202033 is an apocalyptic number.
It is an amenable number.
10100044202033 is a deficient number, since it is larger than the sum of its proper divisors (667205480527).
10100044202033 is a wasteful number, since it uses less digits than its factorization.
10100044202033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50865928.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 10100044202033 its reverse (33020244000101), we get a palindrome (43120288202134).
The spelling of 10100044202033 in words is "ten trillion, one hundred billion, forty-four million, two hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •