Base | Representation |
---|---|
bin | 101010011111000… |
… | …0101110110111000 |
3 | 10200100110002220000 |
4 | 1110332011312320 |
5 | 10404421004224 |
6 | 353242433000 |
7 | 50220041352 |
oct | 12476056670 |
9 | 3610402800 |
10 | 1425563064 |
11 | 6717696a2 |
12 | 339502760 |
13 | 19945c053 |
14 | d74880d2 |
15 | 852440c9 |
hex | 54f85db8 |
1425563064 has 80 divisors (see below), whose sum is σ = 3999984120. Its totient is φ = 474344640.
The previous prime is 1425563057. The next prime is 1425563081. The reversal of 1425563064 is 4603655241.
1425563064 is a `hidden beast` number, since 1 + 42 + 556 + 3 + 0 + 64 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 440974 + ... + 444194.
Almost surely, 21425563064 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 1425563064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1999992060).
1425563064 is an abundant number, since it is smaller than the sum of its proper divisors (2574421056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1425563064 is a wasteful number, since it uses less digits than its factorization.
1425563064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3922 (or 3909 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The square root of 1425563064 is about 37756.6294046489. The cubic root of 1425563064 is about 1125.4567531985.
The spelling of 1425563064 in words is "one billion, four hundred twenty-five million, five hundred sixty-three thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •