Base | Representation |
---|---|
bin | 110100011000111011000110… |
… | …010001011001100001110111 |
3 | 1010012211002102122112222202101 |
4 | 310120323012101121201313 |
5 | 220200024004323322444 |
6 | 2134013230052522531 |
7 | 66350440615315105 |
oct | 6430730621314167 |
9 | 1105732378488671 |
10 | 230411142010999 |
11 | 674638a894a554 |
12 | 21a13281320447 |
13 | 9b748a64c6581 |
14 | 40c7d5cc4cc75 |
15 | 1b987c8a033d4 |
hex | d18ec6459877 |
230411142010999 has 8 divisors (see below), whose sum is σ = 230754081889440. Its totient is φ = 230068280063136.
The previous prime is 230411142010859. The next prime is 230411142011003. The reversal of 230411142010999 is 999010241114032.
230411142010999 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 230411142010999 - 213 = 230411142002807 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230411142010099) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13563667 + ... + 25392820.
It is an arithmetic number, because the mean of its divisors is an integer number (28844260236180).
Almost surely, 2230411142010999 is an apocalyptic number.
230411142010999 is a deficient number, since it is larger than the sum of its proper divisors (342939878441).
230411142010999 is an equidigital number, since it uses as much as digits as its factorization.
230411142010999 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38965289.
The product of its (nonzero) digits is 139968, while the sum is 46.
The spelling of 230411142010999 in words is "two hundred thirty trillion, four hundred eleven billion, one hundred forty-two million, ten thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •