Base | Representation |
---|---|
bin | 1001001000000000010000… |
… | …0001001001011100001101 |
3 | 1022112011012202102222221010 |
4 | 2102000010001021130031 |
5 | 2303340302404410013 |
6 | 33201051512555433 |
7 | 2053603562330265 |
oct | 222000401113415 |
9 | 38464182388833 |
10 | 10033111013133 |
11 | 321902267128a |
12 | 11605986b2b79 |
13 | 57a16cc033a0 |
14 | 2698687da7a5 |
15 | 125eb6c3d7c3 |
hex | 9200404970d |
10033111013133 has 16 divisors (see below), whose sum is σ = 14406664104896. Its totient is φ = 6174159707520.
The previous prime is 10033111013111. The next prime is 10033111013279. The reversal of 10033111013133 is 33131011133001.
It is not a de Polignac number, because 10033111013133 - 28 = 10033111012877 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10033111013533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2764641 + ... + 5263977.
It is an arithmetic number, because the mean of its divisors is an integer number (900416506556).
Almost surely, 210033111013133 is an apocalyptic number.
10033111013133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10033111013133 is a deficient number, since it is larger than the sum of its proper divisors (4373553091763).
10033111013133 is a wasteful number, since it uses less digits than its factorization.
10033111013133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2602284.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 10033111013133 its reverse (33131011133001), we get a palindrome (43164122146134).
The spelling of 10033111013133 in words is "ten trillion, thirty-three billion, one hundred eleven million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •