Base | Representation |
---|---|
bin | 1101101001110010101000… |
… | …00101111001001100111001 |
3 | 10221022012012200020100000112 |
4 | 12310321110011321030321 |
5 | 12413400034422331301 |
6 | 143504252114314105 |
7 | 6216051453160610 |
oct | 664712405711471 |
9 | 127265180210015 |
10 | 30023232230201 |
11 | 9625865987501 |
12 | 344a853888935 |
13 | 139a24265b822 |
14 | 75b1bca4a877 |
15 | 370e8e6ac9bb |
hex | 1b4e54179339 |
30023232230201 has 16 divisors (see below), whose sum is σ = 36118374082560. Its totient is φ = 24379632545040.
The previous prime is 30023232230191. The next prime is 30023232230207. The reversal of 30023232230201 is 10203223232003.
It is a cyclic number.
It is not a de Polignac number, because 30023232230201 - 238 = 29748354323257 is a prime.
It is a super-2 number, since 2×300232322302012 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30023232230207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28609856 + ... + 29640686.
It is an arithmetic number, because the mean of its divisors is an integer number (2257398380160).
Almost surely, 230023232230201 is an apocalyptic number.
It is an amenable number.
30023232230201 is a deficient number, since it is larger than the sum of its proper divisors (6095141852359).
30023232230201 is a wasteful number, since it uses less digits than its factorization.
30023232230201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1249844.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 30023232230201 its reverse (10203223232003), we get a palindrome (40226455462204).
The spelling of 30023232230201 in words is "thirty trillion, twenty-three billion, two hundred thirty-two million, two hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •