Base | Representation |
---|---|
bin | 110100010011000101110010… |
… | …011011000100101001001101 |
3 | 1010011101202210111210210121111 |
4 | 310103011302123010221031 |
5 | 220121442100121132341 |
6 | 2133105135152132021 |
7 | 66306460510441021 |
oct | 6423056233045115 |
9 | 1104352714723544 |
10 | 230010303302221 |
11 | 67319904948902 |
12 | 21969655237011 |
13 | 9b45b561a1460 |
14 | 40b27b5526381 |
15 | 1b8d168688681 |
hex | d131726c4a4d |
230010303302221 has 32 divisors (see below), whose sum is σ = 264492558489600. Its totient is φ = 198249818880960.
The previous prime is 230010303302167. The next prime is 230010303302279. The reversal of 230010303302221 is 122203303010032.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230010303302221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230010303302192 and 230010303302201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230010303302291) 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, 56229450 + ... + 60181156.
It is an arithmetic number, because the mean of its divisors is an integer number (8265392452800).
Almost surely, 2230010303302221 is an apocalyptic number.
It is an amenable number.
230010303302221 is a deficient number, since it is larger than the sum of its proper divisors (34482255187379).
230010303302221 is a wasteful number, since it uses less digits than its factorization.
230010303302221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3955129.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 230010303302221 its reverse (122203303010032), we get a palindrome (352213606312253).
The spelling of 230010303302221 in words is "two hundred thirty trillion, ten billion, three hundred three million, three hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •