Base | Representation |
---|---|
bin | 110100010100100101101000… |
… | …010001110101000111111101 |
3 | 1010011202121102102021200012122 |
4 | 310110211220101311013331 |
5 | 220130133324323303201 |
6 | 2133224314513412325 |
7 | 66320062626615440 |
oct | 6424455021650775 |
9 | 1104677372250178 |
10 | 230113212322301 |
11 | 67359513353830 |
12 | 2198559526a0a5 |
13 | 9b5277658c449 |
14 | 40b7778a69657 |
15 | 1b90b8ce94e1b |
hex | d149684751fd |
230113212322301 has 32 divisors (see below), whose sum is σ = 297587814509568. Its totient is φ = 172739855111040.
The previous prime is 230113212322297. The next prime is 230113212322319. The reversal of 230113212322301 is 103223212311032.
230113212322301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 230113212322301 - 22 = 230113212322297 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230113212322351) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 475783031 + ... + 476266436.
It is an arithmetic number, because the mean of its divisors is an integer number (9299619203424).
Almost surely, 2230113212322301 is an apocalyptic number.
It is an amenable number.
230113212322301 is a deficient number, since it is larger than the sum of its proper divisors (67474602187267).
230113212322301 is a wasteful number, since it uses less digits than its factorization.
230113212322301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 952049601.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 230113212322301 its reverse (103223212311032), we get a palindrome (333336424633333).
The spelling of 230113212322301 in words is "two hundred thirty trillion, one hundred thirteen billion, two hundred twelve million, three hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •