Base | Representation |
---|---|
bin | 11100001110110100… |
… | …000100000010011001 |
3 | 2220020120211012100022 |
4 | 130032310010002121 |
5 | 444040201100441 |
6 | 21531543120225 |
7 | 2122122541166 |
oct | 341664040231 |
9 | 86216735308 |
10 | 30313300121 |
11 | 11946082055 |
12 | 5a5ba43075 |
13 | 2b2126b8a0 |
14 | 1677cc106d |
15 | bc63b384b |
hex | 70ed04099 |
30313300121 has 16 divisors (see below), whose sum is σ = 33709562880. Its totient is φ = 27069716160.
The previous prime is 30313300099. The next prime is 30313300141. The reversal of 30313300121 is 12100331303.
It is a cyclic number.
It is not a de Polignac number, because 30313300121 - 222 = 30309105817 is a prime.
It is a super-2 number, since 2×303133001212 (a number of 22 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 30313300121.
It is not an unprimeable number, because it can be changed into a prime (30313300141) 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, 1364420 + ... + 1386458.
It is an arithmetic number, because the mean of its divisors is an integer number (2106847680).
Almost surely, 230313300121 is an apocalyptic number.
30313300121 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
30313300121 is a deficient number, since it is larger than the sum of its proper divisors (3396262759).
30313300121 is a wasteful number, since it uses less digits than its factorization.
30313300121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25496.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 30313300121 its reverse (12100331303), we get a palindrome (42413631424).
The spelling of 30313300121 in words is "thirty billion, three hundred thirteen million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •