Base | Representation |
---|---|
bin | 1101110111110010101100… |
… | …00011100010011011101001 |
3 | 11000000011221012221112020020 |
4 | 12323321112003202123221 |
5 | 12444240302141113413 |
6 | 144513252130351053 |
7 | 6265602012425334 |
oct | 673712603423351 |
9 | 130004835845206 |
10 | 30504301504233 |
11 | 97a088aa54327 |
12 | 3507b30a2b489 |
13 | 140370a7b50ab |
14 | 7765b79a961b |
15 | 37d74838bc23 |
hex | 1bbe560e26e9 |
30504301504233 has 16 divisors (see below), whose sum is σ = 42227099475456. Its totient is φ = 19566436158720.
The previous prime is 30504301504231. The next prime is 30504301504247. The reversal of 30504301504233 is 33240510340503.
It is not a de Polignac number, because 30504301504233 - 21 = 30504301504231 is a prime.
It is a super-2 number, since 2×305043015042332 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30504301504194 and 30504301504203.
It is not an unprimeable number, because it can be changed into a prime (30504301504231) 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, 947970160 + ... + 948002337.
It is an arithmetic number, because the mean of its divisors is an integer number (2639193717216).
Almost surely, 230504301504233 is an apocalyptic number.
It is an amenable number.
30504301504233 is a deficient number, since it is larger than the sum of its proper divisors (11722797971223).
30504301504233 is a wasteful number, since it uses less digits than its factorization.
30504301504233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1895972704.
The product of its (nonzero) digits is 64800, while the sum is 33.
Adding to 30504301504233 its reverse (33240510340503), we get a palindrome (63744811844736).
The spelling of 30504301504233 in words is "thirty trillion, five hundred four billion, three hundred one million, five hundred four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •