Base | Representation |
---|---|
bin | 100011010011110101000… |
… | …001101010110001111100 |
3 | 22120222011000220222220021 |
4 | 203103311001222301330 |
5 | 304223403414111421 |
6 | 5054412300501524 |
7 | 340210151115460 |
oct | 43236501526174 |
9 | 8528130828807 |
10 | 2426472410236 |
11 | 856074465876 |
12 | 33232484a8a4 |
13 | 147a7a48b284 |
14 | 8562879a4a0 |
15 | 431b8993341 |
hex | 234f506ac7c |
2426472410236 has 72 divisors (see below), whose sum is σ = 5019045732960. Its totient is φ = 1005467074560.
The previous prime is 2426472410203. The next prime is 2426472410353. The reversal of 2426472410236 is 6320142746242.
2426472410236 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 2426472410192 and 2426472410201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30339196 + ... + 30419068.
Almost surely, 22426472410236 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2426472410236, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2509522866480).
2426472410236 is an abundant number, since it is smaller than the sum of its proper divisors (2592573322724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2426472410236 is a wasteful number, since it uses less digits than its factorization.
2426472410236 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81075 (or 81042 counting only the distinct ones).
The product of its (nonzero) digits is 774144, while the sum is 43.
The spelling of 2426472410236 in words is "two trillion, four hundred twenty-six billion, four hundred seventy-two million, four hundred ten thousand, two hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •