Base | Representation |
---|---|
bin | 110100011000111011000110… |
… | …010001011001100001111011 |
3 | 1010012211002102122112222202112 |
4 | 310120323012101121201323 |
5 | 220200024004323323003 |
6 | 2134013230052522535 |
7 | 66350440615315112 |
oct | 6430730621314173 |
9 | 1105732378488675 |
10 | 230411142011003 |
11 | 674638a894a558 |
12 | 21a1328132044b |
13 | 9b748a64c6585 |
14 | 40c7d5cc4cc79 |
15 | 1b987c8a033d8 |
hex | d18ec645987b |
230411142011003 has 2 divisors, whose sum is σ = 230411142011004. Its totient is φ = 230411142011002.
The previous prime is 230411142010859. The next prime is 230411142011021. The reversal of 230411142011003 is 300110241114032.
230411142011003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 230411142011003 - 224 = 230411125233787 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230411142011003.
It is not a weakly prime, because it can be changed into another prime (230411142011803) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115205571005501 + 115205571005502.
It is an arithmetic number, because the mean of its divisors is an integer number (115205571005502).
Almost surely, 2230411142011003 is an apocalyptic number.
230411142011003 is a deficient number, since it is larger than the sum of its proper divisors (1).
230411142011003 is an equidigital number, since it uses as much as digits as its factorization.
230411142011003 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 230411142011003 its reverse (300110241114032), we get a palindrome (530521383125035).
The spelling of 230411142011003 in words is "two hundred thirty trillion, four hundred eleven billion, one hundred forty-two million, eleven thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •