Base | Representation |
---|---|
bin | 1101110010001110011000… |
… | …01101100001000100000001 |
3 | 10222022220011210210200001221 |
4 | 12321013030031201010001 |
5 | 12433122021114200413 |
6 | 144245334340155041 |
7 | 6246020440151020 |
oct | 671071415410401 |
9 | 128286153720057 |
10 | 30313010303233 |
11 | 972774806a779 |
12 | 3496a45998a81 |
13 | 13bb673809428 |
14 | 76b22c37a8b7 |
15 | 37879e77268d |
hex | 1b91cc361101 |
30313010303233 has 32 divisors (see below), whose sum is σ = 37361151959040. Its totient is φ = 24011533261440.
The previous prime is 30313010303201. The next prime is 30313010303263. The reversal of 30313010303233 is 33230301031303.
It is a cyclic number.
It is not a de Polignac number, because 30313010303233 - 25 = 30313010303201 is a prime.
It is a super-2 number, since 2×303130103032332 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30313010303198 and 30313010303207.
It is not an unprimeable number, because it can be changed into a prime (30313010303263) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41313616 + ... + 42040942.
It is an arithmetic number, because the mean of its divisors is an integer number (1167535998720).
Almost surely, 230313010303233 is an apocalyptic number.
It is an amenable number.
30313010303233 is a deficient number, since it is larger than the sum of its proper divisors (7048141655807).
30313010303233 is a wasteful number, since it uses less digits than its factorization.
30313010303233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 735037.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 30313010303233 its reverse (33230301031303), we get a palindrome (63543311334536).
The spelling of 30313010303233 in words is "thirty trillion, three hundred thirteen billion, ten million, three hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •