Base | Representation |
---|---|
bin | 1001000110110000001010… |
… | …10001111000000101110110 |
3 | 2121220012110001110221200102 |
4 | 10203120011101320011312 |
5 | 10111030031340344410 |
6 | 110330313150114102 |
7 | 4134426131456204 |
oct | 443300521700566 |
9 | 77805401427612 |
10 | 20023226106230 |
11 | 641a891150456 |
12 | 22b4775aab932 |
13 | b2324a16aa69 |
14 | 4d31b4ba6074 |
15 | 24acb3e5a2a5 |
hex | 123605478176 |
20023226106230 has 8 divisors (see below), whose sum is σ = 36041806991232. Its totient is φ = 8009290442488.
The previous prime is 20023226106227. The next prime is 20023226106269. The reversal of 20023226106230 is 3260162232002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 20023226106193 and 20023226106202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1001161305302 + ... + 1001161305321.
It is an arithmetic number, because the mean of its divisors is an integer number (4505225873904).
Almost surely, 220023226106230 is an apocalyptic number.
20023226106230 is a deficient number, since it is larger than the sum of its proper divisors (16018580885002).
20023226106230 is a wasteful number, since it uses less digits than its factorization.
20023226106230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2002322610630.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 20023226106230 its reverse (3260162232002), we get a palindrome (23283388338232).
The spelling of 20023226106230 in words is "twenty trillion, twenty-three billion, two hundred twenty-six million, one hundred six thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •