Base | Representation |
---|---|
bin | 1101101001011101111011… |
… | …11100010011111100110011 |
3 | 10221021010112110122012021211 |
4 | 12310232331330103330303 |
5 | 12413204312014420311 |
6 | 143455213513300551 |
7 | 6215206251036415 |
oct | 664567574237463 |
9 | 127233473565254 |
10 | 30012123201331 |
11 | 9621085150707 |
12 | 3448673404757 |
13 | 1399191c7bb6b |
14 | 75a8474b89b5 |
15 | 370a3e283821 |
hex | 1b4bbdf13f33 |
30012123201331 has 32 divisors (see below), whose sum is σ = 34906147983360. Its totient is φ = 25595269641216.
The previous prime is 30012123201329. The next prime is 30012123201343. The reversal of 30012123201331 is 13310232121003.
It is a cyclic number.
It is not a de Polignac number, because 30012123201331 - 21 = 30012123201329 is a prime.
It is a super-2 number, since 2×300121232013312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30012123201301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 166074135 + ... + 166254751.
It is an arithmetic number, because the mean of its divisors is an integer number (1090817124480).
Almost surely, 230012123201331 is an apocalyptic number.
30012123201331 is a deficient number, since it is larger than the sum of its proper divisors (4894024782029).
30012123201331 is a wasteful number, since it uses less digits than its factorization.
30012123201331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203043.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30012123201331 its reverse (13310232121003), we get a palindrome (43322355322334).
The spelling of 30012123201331 in words is "thirty trillion, twelve billion, one hundred twenty-three million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •