Base | Representation |
---|---|
bin | 101001111010100… |
… | …1110101111110100 |
3 | 10122000111201110220 |
4 | 1103311032233310 |
5 | 10340023303324 |
6 | 351321214340 |
7 | 46565511054 |
oct | 12365165764 |
9 | 3560451426 |
10 | 1406462964 |
11 | 661a03495 |
12 | 3330313b0 |
13 | 19550240a |
14 | d4b15564 |
15 | 8371eb79 |
hex | 53d4ebf4 |
1406462964 has 12 divisors (see below), whose sum is σ = 3281746944. Its totient is φ = 468820984.
The previous prime is 1406462957. The next prime is 1406462977. The reversal of 1406462964 is 4692646041.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-3 number, since 3×14064629643 (a number of 28 digits) contains 333 as substring.
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 3 ways as a sum of consecutive naturals, for example, 58602612 + ... + 58602635.
It is an arithmetic number, because the mean of its divisors is an integer number (273478912).
Almost surely, 21406462964 is an apocalyptic number.
It is an amenable number.
1406462964 is an abundant number, since it is smaller than the sum of its proper divisors (1875283980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1406462964 is a wasteful number, since it uses less digits than its factorization.
1406462964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117205254 (or 117205252 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 42.
The square root of 1406462964 is about 37502.8394125032. The cubic root of 1406462964 is about 1120.4077395108.
It can be divided in two parts, 14064 and 62964, that added together give a triangular number (77028 = T392).
The spelling of 1406462964 in words is "one billion, four hundred six million, four hundred sixty-two thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •