Base | Representation |
---|---|
bin | 1101101001001001011100… |
… | …10011011111011100010101 |
3 | 10221020002010212121121112012 |
4 | 12310210232103133130111 |
5 | 12413014300044032041 |
6 | 143450154214034005 |
7 | 6214336543342001 |
oct | 664445623373425 |
9 | 127202125547465 |
10 | 30001123424021 |
11 | 9617450055162 |
12 | 3446503648905 |
13 | 139812b1019a9 |
14 | 75a0c2665701 |
15 | 3705e873a3eb |
hex | 1b492e4df715 |
30001123424021 has 2 divisors, whose sum is σ = 30001123424022. Its totient is φ = 30001123424020.
The previous prime is 30001123423939. The next prime is 30001123424047. The reversal of 30001123424021 is 12042432110003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27563434507921 + 2437688916100 = 5250089^2 + 1561310^2 .
It is an emirp because it is prime and its reverse (12042432110003) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30001123424021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30001123424071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15000561712010 + 15000561712011.
It is an arithmetic number, because the mean of its divisors is an integer number (15000561712011).
Almost surely, 230001123424021 is an apocalyptic number.
It is an amenable number.
30001123424021 is a deficient number, since it is larger than the sum of its proper divisors (1).
30001123424021 is an equidigital number, since it uses as much as digits as its factorization.
30001123424021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 30001123424021 its reverse (12042432110003), we get a palindrome (42043555534024).
The spelling of 30001123424021 in words is "thirty trillion, one billion, one hundred twenty-three million, four hundred twenty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •