Base | Representation |
---|---|
bin | 1011110101111010011… |
… | …00111111101001000010 |
3 | 1102220021122102222101122 |
4 | 11322331030333221002 |
5 | 23131313203213200 |
6 | 510532225232242 |
7 | 41253251232404 |
oct | 5727514775102 |
9 | 1386248388348 |
10 | 406901226050 |
11 | 147625152700 |
12 | 66a3a492682 |
13 | 2c4a833c857 |
14 | 159a096ab74 |
15 | a8b7701385 |
hex | 5ebd33fa42 |
406901226050 has 162 divisors, whose sum is σ = 852365118969. Its totient is φ = 144409768800.
The previous prime is 406901226037. The next prime is 406901226059. The reversal of 406901226050 is 50622109604.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 398763201529 + 8138024521 = 631477^2 + 90211^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=451055.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 406901226050.
It is not an unprimeable number, because it can be changed into a prime (406901226059) by changing a digit.
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 80 ways as a sum of consecutive naturals, for example, 2927346881 + ... + 2927347019.
Almost surely, 2406901226050 is an apocalyptic number.
406901226050 is an abundant number, since it is smaller than the sum of its proper divisors (445463892919).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
406901226050 is a wasteful number, since it uses less digits than its factorization.
406901226050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430 (or 216 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 406901226050 in words is "four hundred six billion, nine hundred one million, two hundred twenty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •