Base | Representation |
---|---|
bin | 1001000111111111111101… |
… | …1000000000110101010111 |
3 | 1022112011000022212200011102 |
4 | 2101333333120000311113 |
5 | 2303340122434333421 |
6 | 33201040051300315 |
7 | 2053601625263660 |
oct | 221777730006527 |
9 | 38464008780142 |
10 | 10033033121111 |
11 | 3218a926aa910 |
12 | 11605765aa69b |
13 | 57a159a30630 |
14 | 26985c322367 |
15 | 125eaeea460b |
hex | 91fff600d57 |
10033033121111 has 16 divisors (see below), whose sum is σ = 13470925590528. Its totient is φ = 7216567279200.
The previous prime is 10033033121101. The next prime is 10033033121123. The reversal of 10033033121111 is 11112133033001.
It is a cyclic number.
It is not a de Polignac number, because 10033033121111 - 234 = 10015853251927 is a prime.
It is a super-3 number, since 3×100330331211113 (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 (10033033121101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5011504055 + ... + 5011506056.
It is an arithmetic number, because the mean of its divisors is an integer number (841932849408).
Almost surely, 210033033121111 is an apocalyptic number.
10033033121111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10033033121111 is a deficient number, since it is larger than the sum of its proper divisors (3437892469417).
10033033121111 is a wasteful number, since it uses less digits than its factorization.
10033033121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10023010142.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 10033033121111 its reverse (11112133033001), we get a palindrome (21145166154112).
The spelling of 10033033121111 in words is "ten trillion, thirty-three billion, thirty-three million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •