Base | Representation |
---|---|
bin | 11110100101101110111… |
… | …100110001100001101001 |
3 | 21102221212222211020121122 |
4 | 132211232330301201221 |
5 | 233420100202324001 |
6 | 4245405215345025 |
7 | 304605002602652 |
oct | 36455674614151 |
9 | 7387788736548 |
10 | 2102100433001 |
11 | 74054a990328 |
12 | 29b499222175 |
13 | 1232c5283a7a |
14 | 73a56870529 |
15 | 39a31817b1b |
hex | 1e96ef31869 |
2102100433001 has 8 divisors (see below), whose sum is σ = 2108113094304. Its totient is φ = 2096094810880.
The previous prime is 2102100432911. The next prime is 2102100433061. The reversal of 2102100433001 is 1003340012012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2102100433001 - 218 = 2102100170857 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2102100433061) 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 in 7 ways as a sum of consecutive naturals, for example, 1161395 + ... + 2356488.
It is an arithmetic number, because the mean of its divisors is an integer number (263514136788).
Almost surely, 22102100433001 is an apocalyptic number.
It is an amenable number.
2102100433001 is a deficient number, since it is larger than the sum of its proper divisors (6012661303).
2102100433001 is a wasteful number, since it uses less digits than its factorization.
2102100433001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3519591.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2102100433001 its reverse (1003340012012), we get a palindrome (3105440445013).
The spelling of 2102100433001 in words is "two trillion, one hundred two billion, one hundred million, four hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •