Base | Representation |
---|---|
bin | 10110110000111111000111… |
… | …000011110110100110101101 |
3 | 111010111200210111000010121201 |
4 | 112300333013003312212231 |
5 | 101110410031003010013 |
6 | 552540004055525501 |
7 | 30042446156411620 |
oct | 2660770703664655 |
9 | 433450714003551 |
10 | 100123322313133 |
11 | 299a2076266329 |
12 | b2906a2089891 |
13 | 43b3786725872 |
14 | 1aa1dcd4a1db7 |
15 | b896862843dd |
hex | 5b0fc70f69ad |
100123322313133 has 8 divisors (see below), whose sum is σ = 114848892650240. Its totient is φ = 85503311620560.
The previous prime is 100123322313127. The next prime is 100123322313151. The reversal of 100123322313133 is 331313223321001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100123322313133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100123322313103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26389909098 + ... + 26389912891.
It is an arithmetic number, because the mean of its divisors is an integer number (14356111581280).
Almost surely, 2100123322313133 is an apocalyptic number.
It is an amenable number.
100123322313133 is a deficient number, since it is larger than the sum of its proper divisors (14725570337107).
100123322313133 is an equidigital number, since it uses as much as digits as its factorization.
100123322313133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52779822267.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 100123322313133 its reverse (331313223321001), we get a palindrome (431436545634134).
The spelling of 100123322313133 in words is "one hundred trillion, one hundred twenty-three billion, three hundred twenty-two million, three hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •