Base | Representation |
---|---|
bin | 1100010100001001001… |
… | …00110000001110000010 |
3 | 1111110011201200001021010 |
4 | 12022010210300032002 |
5 | 23413033020202320 |
6 | 522214514141350 |
7 | 42366403226361 |
oct | 6120444601602 |
9 | 1443151601233 |
10 | 423131022210 |
11 | 1534a3481786 |
12 | 6a009881856 |
13 | 30b938b3330 |
14 | 166a02397d8 |
15 | b017489ae0 |
hex | 6284930382 |
423131022210 has 128 divisors (see below), whose sum is σ = 1158321233664. Its totient is φ = 97998151680.
The previous prime is 423131022199. The next prime is 423131022211. The reversal of 423131022210 is 12220131324.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (423131022211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 26890045 + ... + 26905775.
It is an arithmetic number, because the mean of its divisors is an integer number (9049384638).
Almost surely, 2423131022210 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 423131022210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (579160616832).
423131022210 is an abundant number, since it is smaller than the sum of its proper divisors (735190211454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
423131022210 is a wasteful number, since it uses less digits than its factorization.
423131022210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19828.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 423131022210 its reverse (12220131324), we get a palindrome (435351153534).
The spelling of 423131022210 in words is "four hundred twenty-three billion, one hundred thirty-one million, twenty-two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •