Base | Representation |
---|---|
bin | 100000011100111110001… |
… | …011011101111011111111 |
3 | 21220012100200100010010212 |
4 | 200130332023131323333 |
5 | 243014302043021343 |
6 | 4424301431423035 |
7 | 320056505413124 |
oct | 40347613357377 |
9 | 7805320303125 |
10 | 2230131220223 |
11 | 78a87aa30785 |
12 | 30026a524a7b |
13 | 1323ba1a062a |
14 | 79d205b674b |
15 | 3d02684ac18 |
hex | 2073e2ddeff |
2230131220223 has 8 divisors (see below), whose sum is σ = 2233964924928. Its totient is φ = 2226297762304.
The previous prime is 2230131220199. The next prime is 2230131220283. The reversal of 2230131220223 is 3220221310322.
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 2230131220223 - 216 = 2230131154687 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 (2230131220283) 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, 34579415 + ... + 34643847.
It is an arithmetic number, because the mean of its divisors is an integer number (279245615616).
Almost surely, 22230131220223 is an apocalyptic number.
2230131220223 is a deficient number, since it is larger than the sum of its proper divisors (3833704705).
2230131220223 is an equidigital number, since it uses as much as digits as its factorization.
2230131220223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123393.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 2230131220223 its reverse (3220221310322), we get a palindrome (5450352530545).
Subtracting 2230131220223 from its reverse (3220221310322), we obtain a palindrome (990090090099).
The spelling of 2230131220223 in words is "two trillion, two hundred thirty billion, one hundred thirty-one million, two hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •