Base | Representation |
---|---|
bin | 11100001001111110… |
… | …000000111111011001 |
3 | 2220000220212220002121 |
4 | 130021332000333121 |
5 | 443403344214001 |
6 | 21515521101241 |
7 | 2120114645515 |
oct | 341176007731 |
9 | 86026786077 |
10 | 30232023001 |
11 | 11904209384 |
12 | 5a38787821 |
13 | 2b0a48210b |
14 | 166b1a5145 |
15 | bbe1ab6a1 |
hex | 709f80fd9 |
30232023001 has 2 divisors, whose sum is σ = 30232023002. Its totient is φ = 30232023000.
The previous prime is 30232022993. The next prime is 30232023047. The reversal of 30232023001 is 10032023203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22410389401 + 7821633600 = 149701^2 + 88440^2 .
It is an emirp because it is prime and its reverse (10032023203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30232023001 - 23 = 30232022993 is a prime.
It is not a weakly prime, because it can be changed into another prime (30232083001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15116011500 + 15116011501.
It is an arithmetic number, because the mean of its divisors is an integer number (15116011501).
Almost surely, 230232023001 is an apocalyptic number.
It is an amenable number.
30232023001 is a deficient number, since it is larger than the sum of its proper divisors (1).
30232023001 is an equidigital number, since it uses as much as digits as its factorization.
30232023001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 30232023001 its reverse (10032023203), we get a palindrome (40264046204).
It can be divided in two parts, 3023202 and 3001, that added together give a palindrome (3026203).
The spelling of 30232023001 in words is "thirty billion, two hundred thirty-two million, twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •