Base | Representation |
---|---|
bin | 1001000110010000100010… |
… | …0110000010000100000001 |
3 | 1022102021210211202002221000 |
4 | 2101210020212002010001 |
5 | 2302342343443120113 |
6 | 33135212110122213 |
7 | 2051462466520053 |
oct | 221441046020401 |
9 | 38367724662830 |
10 | 10003123020033 |
11 | 3207334189210 |
12 | 11568097b0369 |
13 | 5773a1183480 |
14 | 268221bd98d3 |
15 | 12530e1d7373 |
hex | 91908982101 |
10003123020033 has 128 divisors (see below), whose sum is σ = 18072314265600. Its totient is φ = 5385365222400.
The previous prime is 10003123020013. The next prime is 10003123020047. The reversal of 10003123020033 is 33002032130001.
It is not a de Polignac number, because 10003123020033 - 210 = 10003123019009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10003123019988 and 10003123020015.
It is not an unprimeable number, because it can be changed into a prime (10003123020013) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 21191241 + ... + 21658137.
It is an arithmetic number, because the mean of its divisors is an integer number (141189955200).
Almost surely, 210003123020033 is an apocalyptic number.
10003123020033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10003123020033 is a deficient number, since it is larger than the sum of its proper divisors (8069191245567).
10003123020033 is a wasteful number, since it uses less digits than its factorization.
10003123020033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 467140 (or 467134 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 10003123020033 its reverse (33002032130001), we get a palindrome (43005155150034).
The spelling of 10003123020033 in words is "ten trillion, three billion, one hundred twenty-three million, twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •