Base | Representation |
---|---|
bin | 1111001001001010010010… |
… | …11010000000111010000001 |
3 | 11100220110102010112011102210 |
4 | 13210211021122000322001 |
5 | 13331042112412031423 |
6 | 154453505525532333 |
7 | 10004565562153116 |
oct | 744451132007201 |
9 | 140813363464383 |
10 | 33300113002113 |
11 | a679553726201 |
12 | 38999505740a9 |
13 | 15772583146b9 |
14 | 831a3c3dc90d |
15 | 3cb32ba9db93 |
hex | 1e4949680e81 |
33300113002113 has 16 divisors (see below), whose sum is σ = 46737554473280. Its totient is φ = 21031401121344.
The previous prime is 33300113002111. The next prime is 33300113002199. The reversal of 33300113002113 is 31120031100333.
It is not a de Polignac number, because 33300113002113 - 21 = 33300113002111 is a prime.
It is a super-2 number, since 2×333001130021132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 33300113002113.
It is not an unprimeable number, because it can be changed into a prime (33300113002111) 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, 1452495 + ... + 8289147.
It is an arithmetic number, because the mean of its divisors is an integer number (2921097154580).
Almost surely, 233300113002113 is an apocalyptic number.
It is an amenable number.
33300113002113 is a deficient number, since it is larger than the sum of its proper divisors (13437441471167).
33300113002113 is a wasteful number, since it uses less digits than its factorization.
33300113002113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6922128.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 33300113002113 its reverse (31120031100333), we get a palindrome (64420144102446).
The spelling of 33300113002113 in words is "thirty-three trillion, three hundred billion, one hundred thirteen million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •