Base | Representation |
---|---|
bin | 1001000111111111110110… |
… | …0101110111111000001011 |
3 | 1022112010221020120112010112 |
4 | 2101333331211313320023 |
5 | 2303340042304400021 |
6 | 33201033102104535 |
7 | 2053601113044311 |
oct | 221777545677013 |
9 | 38463836515115 |
10 | 10033003200011 |
11 | 3218a77823730 |
12 | 116056857b14b |
13 | 57a15378553c |
14 | 2698583740b1 |
15 | 125eac543d5b |
hex | 91ffd977e0b |
10033003200011 has 8 divisors (see below), whose sum is σ = 10945122337344. Its totient is φ = 9120888718920.
The previous prime is 10033003200007. The next prime is 10033003200037. The reversal of 10033003200011 is 11000230033001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10033003200011 - 22 = 10033003200007 is a prime.
It is a super-2 number, since 2×100330032000112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10033003200001) 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, 4568960 + ... + 6398546.
It is an arithmetic number, because the mean of its divisors is an integer number (1368140292168).
Almost surely, 210033003200011 is an apocalyptic number.
10033003200011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10033003200011 is a deficient number, since it is larger than the sum of its proper divisors (912119137333).
10033003200011 is a wasteful number, since it uses less digits than its factorization.
10033003200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2328121.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 10033003200011 its reverse (11000230033001), we get a palindrome (21033233233012).
The spelling of 10033003200011 in words is "ten trillion, thirty-three billion, three million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •