Base | Representation |
---|---|
bin | 10111001001010111… |
… | …01111010001001110 |
3 | 1012002000211222021120 |
4 | 23210223233101032 |
5 | 200422202340041 |
6 | 5413025141410 |
7 | 616641255660 |
oct | 134453572116 |
9 | 35060758246 |
10 | 12426605646 |
11 | 52a7549824 |
12 | 24a978a866 |
13 | 12306600c0 |
14 | 85c54a530 |
15 | 4cae3c366 |
hex | 2e4aef44e |
12426605646 has 128 divisors (see below), whose sum is σ = 31982985216. Its totient is φ = 3128526720.
The previous prime is 12426605629. The next prime is 12426605683. The reversal of 12426605646 is 64650662421.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12426605598 and 12426605607.
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 63 ways as a sum of consecutive naturals, for example, 11389561 + ... + 11390651.
It is an arithmetic number, because the mean of its divisors is an integer number (249867072).
Almost surely, 212426605646 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12426605646, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15991492608).
12426605646 is an abundant number, since it is smaller than the sum of its proper divisors (19556379570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12426605646 is a wasteful number, since it uses less digits than its factorization.
12426605646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2046.
The product of its (nonzero) digits is 414720, while the sum is 42.
The spelling of 12426605646 in words is "twelve billion, four hundred twenty-six million, six hundred five thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •