Base | Representation |
---|---|
bin | 110000001000101111001100… |
… | …1001000111111000110010110 |
3 | 2001112011220210222201011100020 |
4 | 1200101132121020333012112 |
5 | 420444201000013224342 |
6 | 4100305222033330010 |
7 | 155120414016025041 |
oct | 14021363110770626 |
9 | 2045156728634306 |
10 | 423413330211222 |
11 | 112a046485a579a |
12 | 3b5a440b706906 |
13 | 152349235b9660 |
14 | 767b4590c5c58 |
15 | 33e3e4452e0ec |
hex | 181179923f196 |
423413330211222 has 128 divisors (see below), whose sum is σ = 917153773240320. Its totient is φ = 129542503063680.
The previous prime is 423413330211181. The next prime is 423413330211247. The reversal of 423413330211222 is 222112033314324.
It is a happy number.
It is a super-3 number, since 3×4234133302112223 (a number of 45 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 18352609947 + ... + 18352633017.
It is an arithmetic number, because the mean of its divisors is an integer number (7165263853440).
Almost surely, 2423413330211222 is an apocalyptic number.
423413330211222 is an abundant number, since it is smaller than the sum of its proper divisors (493740443029098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
423413330211222 is a wasteful number, since it uses less digits than its factorization.
423413330211222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25218.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 423413330211222 its reverse (222112033314324), we get a palindrome (645525363525546).
The spelling of 423413330211222 in words is "four hundred twenty-three trillion, four hundred thirteen billion, three hundred thirty million, two hundred eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •