Base | Representation |
---|---|
bin | 101001111101110… |
… | …0100110100011100 |
3 | 10122010122020001120 |
4 | 1103323210310130 |
5 | 10340440014421 |
6 | 351421010540 |
7 | 46615606206 |
oct | 12373446434 |
9 | 3563566046 |
10 | 1408126236 |
11 | 66293a0a0 |
12 | 3336b3a50 |
13 | 1959654ba |
14 | d5029776 |
15 | 8394c8c6 |
hex | 53ee4d1c |
1408126236 has 24 divisors (see below), whose sum is σ = 3584321664. Its totient is φ = 426704880.
The previous prime is 1408126231. The next prime is 1408126259. The reversal of 1408126236 is 6326218041.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 1408126197 and 1408126206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1408126231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5333680 + ... + 5333943.
It is an arithmetic number, because the mean of its divisors is an integer number (149346736).
Almost surely, 21408126236 is an apocalyptic number.
It is an amenable number.
1408126236 is an abundant number, since it is smaller than the sum of its proper divisors (2176195428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1408126236 is a wasteful number, since it uses less digits than its factorization.
1408126236 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10667641 (or 10667639 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 33.
The square root of 1408126236 is about 37525.0081412383. The cubic root of 1408126236 is about 1120.8492273063.
The spelling of 1408126236 in words is "one billion, four hundred eight million, one hundred twenty-six thousand, two hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •