Base | Representation |
---|---|
bin | 1101110010001100111011… |
… | …11001011111000010100101 |
3 | 10222022211011122201211012100 |
4 | 12321012131321133002211 |
5 | 12433113423211101013 |
6 | 144245125302242313 |
7 | 6245662253554611 |
oct | 671063571370245 |
9 | 128284148654170 |
10 | 30312233300133 |
11 | 9727389506854 |
12 | 3496869726399 |
13 | 13bb57b848a95 |
14 | 76b1970ba341 |
15 | 37875643e473 |
hex | 1b919de5f0a5 |
30312233300133 has 48 divisors (see below), whose sum is σ = 46183912041280. Its totient is φ = 19105061490432.
The previous prime is 30312233300117. The next prime is 30312233300143. The reversal of 30312233300133 is 33100333221303.
30312233300133 is a `hidden beast` number, since 3 + 0 + 3 + 1 + 223 + 3 + 300 + 133 = 666.
It is not a de Polignac number, because 30312233300133 - 24 = 30312233300117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30312233300097 and 30312233300106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30312233300143) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 693352191 + ... + 693395907.
Almost surely, 230312233300133 is an apocalyptic number.
It is an amenable number.
30312233300133 is a deficient number, since it is larger than the sum of its proper divisors (15871678741147).
30312233300133 is a wasteful number, since it uses less digits than its factorization.
30312233300133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52018 (or 52015 counting only the distinct ones).
The product of its (nonzero) digits is 8748, while the sum is 27.
Adding to 30312233300133 its reverse (33100333221303), we get a palindrome (63412566521436).
The spelling of 30312233300133 in words is "thirty trillion, three hundred twelve billion, two hundred thirty-three million, three hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •