Base | Representation |
---|---|
bin | 110000000111010110001001… |
… | …1000000010010001110110011 |
3 | 2001111111122012220122000010211 |
4 | 1200032230103000102032303 |
5 | 420433032330403103243 |
6 | 4100041314344404551 |
7 | 155100534130320004 |
oct | 14016542300221663 |
9 | 2044448186560124 |
10 | 423222101222323 |
11 | 112940537842aa7 |
12 | 3b573341476757 |
13 | 1521c8994837a0 |
14 | 76720b7c4d1ab |
15 | 33ddea1102d9d |
hex | 180eb130123b3 |
423222101222323 has 16 divisors (see below), whose sum is σ = 463046067792000. Its totient is φ = 384484589101440.
The previous prime is 423222101222299. The next prime is 423222101222329. The reversal of 423222101222323 is 323222101222324.
It is a cyclic number.
It is not a de Polignac number, because 423222101222323 - 213 = 423222101214131 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (423222101222329) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1002053083 + ... + 1002475348.
It is an arithmetic number, because the mean of its divisors is an integer number (28940379237000).
Almost surely, 2423222101222323 is an apocalyptic number.
423222101222323 is a deficient number, since it is larger than the sum of its proper divisors (39823966569677).
423222101222323 is a wasteful number, since it uses less digits than its factorization.
423222101222323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2004528702.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 423222101222323 its reverse (323222101222324), we get a palindrome (746444202444647).
Subtracting from 423222101222323 its reverse (323222101222324), we obtain a palindrome (99999999999999).
The spelling of 423222101222323 in words is "four hundred twenty-three trillion, two hundred twenty-two billion, one hundred one million, two hundred twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •