Base | Representation |
---|---|
bin | 10110111000010000100010… |
… | …011010000011100000010101 |
3 | 111012021110201211110011202210 |
4 | 112320100202122003200111 |
5 | 101142102022143104013 |
6 | 554001333430024033 |
7 | 30123530334623610 |
oct | 2670204232034025 |
9 | 435243654404683 |
10 | 100623071066133 |
11 | 2a075006419180 |
12 | b351512aa8019 |
13 | 441b93a7b5475 |
14 | 1abc27b1a3177 |
15 | b97684cd8cc3 |
hex | 5b8422683815 |
100623071066133 has 16 divisors (see below), whose sum is σ = 167269520733696. Its totient is φ = 52271725229040.
The previous prime is 100623071066131. The next prime is 100623071066183. The reversal of 100623071066133 is 331660170326001.
It is not a de Polignac number, because 100623071066133 - 21 = 100623071066131 is a prime.
It is a super-2 number, since 2×1006230710661332 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 100623071066091 and 100623071066100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100623071066131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 217798854891 + ... + 217798855352.
It is an arithmetic number, because the mean of its divisors is an integer number (10454345045856).
Almost surely, 2100623071066133 is an apocalyptic number.
It is an amenable number.
100623071066133 is a deficient number, since it is larger than the sum of its proper divisors (66646449667563).
100623071066133 is a wasteful number, since it uses less digits than its factorization.
100623071066133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 435597710264.
The product of its (nonzero) digits is 81648, while the sum is 39.
The spelling of 100623071066133 in words is "one hundred trillion, six hundred twenty-three billion, seventy-one million, sixty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •