Base | Representation |
---|---|
bin | 1001001101001111000111… |
… | …0100011111110010100101 |
3 | 1022211202020021110200021121 |
4 | 2103103301310133302211 |
5 | 2311323401001121013 |
6 | 33310235250213541 |
7 | 2063235243305140 |
oct | 223236164376245 |
9 | 38752207420247 |
10 | 10123000020133 |
11 | 325315a672720 |
12 | 1175aa42842b1 |
13 | 585796a33320 |
14 | 26dd54a85057 |
15 | 1284c849358d |
hex | 934f1d1fca5 |
10123000020133 has 32 divisors (see below), whose sum is σ = 13593966527232. Its totient is φ = 7280075404800.
The previous prime is 10123000020047. The next prime is 10123000020139. The reversal of 10123000020133 is 33102000032101.
It is not a de Polignac number, because 10123000020133 - 233 = 10114410085541 is a prime.
It is a super-2 number, since 2×101230000201332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10123000020139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5246463 + ... + 6911683.
It is an arithmetic number, because the mean of its divisors is an integer number (424811453976).
Almost surely, 210123000020133 is an apocalyptic number.
10123000020133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10123000020133 is a deficient number, since it is larger than the sum of its proper divisors (3470966507099).
10123000020133 is a wasteful number, since it uses less digits than its factorization.
10123000020133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1671325.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10123000020133 its reverse (33102000032101), we get a palindrome (43225000052234).
The spelling of 10123000020133 in words is "ten trillion, one hundred twenty-three billion, twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •