Base | Representation |
---|---|
bin | 101010011010001… |
… | …1000001011000000 |
3 | 10200011122201212000 |
4 | 1110310120023000 |
5 | 10403243013030 |
6 | 353112104000 |
7 | 50156304363 |
oct | 12464301300 |
9 | 3604581760 |
10 | 1423016640 |
11 | 67028a511 |
12 | 338695000 |
13 | 198a79ca6 |
14 | d6dc40da |
15 | 84dde860 |
hex | 54d182c0 |
1423016640 has 112 divisors (see below), whose sum is σ = 5020116960. Its totient is φ = 379468800.
The previous prime is 1423016593. The next prime is 1423016641. The reversal of 1423016640 is 466103241.
1423016640 is a `hidden beast` number, since 1 + 4 + 2 + 3 + 0 + 16 + 640 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1423016641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 73711 + ... + 90990.
Almost surely, 21423016640 is an apocalyptic number.
1423016640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1423016640 is an abundant number, since it is smaller than the sum of its proper divisors (3597100320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1423016640 is a wasteful number, since it uses less digits than its factorization.
1423016640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164727 (or 164711 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 1423016640 is about 37722.8927840907. The cubic root of 1423016640 is about 1124.7862349399.
Adding to 1423016640 its reverse (466103241), we get a palindrome (1889119881).
The spelling of 1423016640 in words is "one billion, four hundred twenty-three million, sixteen thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •