Base | Representation |
---|---|
bin | 1101110010001000110101… |
… | …10000011101101100100001 |
3 | 10222022121111022201002111111 |
4 | 12321010122300131230201 |
5 | 12433044421434320113 |
6 | 144244123104543321 |
7 | 6245553606415432 |
oct | 671043260355441 |
9 | 128277438632444 |
10 | 30310033120033 |
11 | 972645a573997 |
12 | 3496354921b41 |
13 | 13bb2baa83474 |
14 | 76b028bd3489 |
15 | 3786781d913d |
hex | 1b911ac1db21 |
30310033120033 has 8 divisors (see below), whose sum is σ = 30807477320256. Its totient is φ = 29812606933200.
The previous prime is 30310033119991. The next prime is 30310033120061. The reversal of 30310033120033 is 33002133001303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30310033120033 - 29 = 30310033119521 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30310033119986 and 30310033120013.
It is not an unprimeable number, because it can be changed into a prime (30310033420033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1089391 + ... + 7861732.
It is an arithmetic number, because the mean of its divisors is an integer number (3850934665032).
Almost surely, 230310033120033 is an apocalyptic number.
It is an amenable number.
30310033120033 is a deficient number, since it is larger than the sum of its proper divisors (497444200223).
30310033120033 is an equidigital number, since it uses as much as digits as its factorization.
30310033120033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9006695.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 30310033120033 its reverse (33002133001303), we get a palindrome (63312166121336).
The spelling of 30310033120033 in words is "thirty trillion, three hundred ten billion, thirty-three million, one hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •