Base | Representation |
---|---|
bin | 1101101111110110000011… |
… | …10110100000100100100001 |
3 | 10222001002002112201120210020 |
4 | 12313323001312200210201 |
5 | 12430302030410333441 |
6 | 144144011502024053 |
7 | 6240064054112013 |
oct | 667730166404441 |
9 | 128032075646706 |
10 | 30231232121121 |
11 | 96a5aa24510a9 |
12 | 3483022578029 |
13 | 13b3a40183265 |
14 | 7672b13a81b3 |
15 | 3765b5109e66 |
hex | 1b7ec1da0921 |
30231232121121 has 16 divisors (see below), whose sum is σ = 42429916323840. Its totient is φ = 19093357175760.
The previous prime is 30231232121119. The next prime is 30231232121143. The reversal of 30231232121121 is 12112123213203.
It is not a de Polignac number, because 30231232121121 - 21 = 30231232121119 is a prime.
It is a super-2 number, since 2×302312321211212 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30231232121091 and 30231232121100.
It is not an unprimeable number, because it can be changed into a prime (30231232121191) 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, 38097276 + ... + 38882706.
It is an arithmetic number, because the mean of its divisors is an integer number (2651869770240).
Almost surely, 230231232121121 is an apocalyptic number.
It is an amenable number.
30231232121121 is a deficient number, since it is larger than the sum of its proper divisors (12198684202719).
30231232121121 is a wasteful number, since it uses less digits than its factorization.
30231232121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1460716.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 30231232121121 its reverse (12112123213203), we get a palindrome (42343355334324).
The spelling of 30231232121121 in words is "thirty trillion, two hundred thirty-one billion, two hundred thirty-two million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •