Base | Representation |
---|---|
bin | 1001000110010000110101… |
… | …1000010100100111101111 |
3 | 1022102022000102211100221200 |
4 | 2101210031120110213233 |
5 | 2302343030021441421 |
6 | 33135224055100543 |
7 | 2051464463140542 |
oct | 221441530244757 |
9 | 38368012740850 |
10 | 10003203312111 |
11 | 32073755398a9 |
12 | 1156830671753 |
13 | 5773b49b6789 |
14 | 26822c73a859 |
15 | 125316297726 |
hex | 9190d6149ef |
10003203312111 has 12 divisors (see below), whose sum is σ = 14449356603240. Its totient is φ = 6668670599280.
The previous prime is 10003203312103. The next prime is 10003203312121. The reversal of 10003203312111 is 11121330230001.
10003203312111 is a `hidden beast` number, since 1 + 0 + 0 + 0 + 320 + 331 + 2 + 1 + 11 = 666.
It is not a de Polignac number, because 10003203312111 - 23 = 10003203312103 is a prime.
It is a super-3 number, since 3×100032033121113 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10003203312121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10484905 + ... + 11399106.
It is an arithmetic number, because the mean of its divisors is an integer number (1204113050270).
Almost surely, 210003203312111 is an apocalyptic number.
10003203312111 is a deficient number, since it is larger than the sum of its proper divisors (4446153291129).
10003203312111 is a wasteful number, since it uses less digits than its factorization.
10003203312111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21934806 (or 21934803 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10003203312111 its reverse (11121330230001), we get a palindrome (21124533542112).
The spelling of 10003203312111 in words is "ten trillion, three billion, two hundred three million, three hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •