Base | Representation |
---|---|
bin | 100000110100110… |
… | …0110111100100000 |
3 | 2211202112021001202 |
4 | 1001221212330200 |
5 | 4223431121324 |
6 | 301143220332 |
7 | 36202653605 |
oct | 10151467440 |
9 | 2752467052 |
10 | 1101426464 |
11 | 5157aa006 |
12 | 268a476a8 |
13 | 147260048 |
14 | a63d06ac |
15 | 66a688ae |
hex | 41a66f20 |
1101426464 has 48 divisors (see below), whose sum is σ = 2319769368. Its totient is φ = 512950272.
The previous prime is 1101426451. The next prime is 1101426493. The reversal of 1101426464 is 4646241011.
It can be written as a sum of positive squares in 4 ways, for example, as 964723600 + 136702864 = 31060^2 + 11692^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42332 + ... + 63204.
Almost surely, 21101426464 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 1101426464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1159884684).
1101426464 is an abundant number, since it is smaller than the sum of its proper divisors (1218342904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101426464 is a wasteful number, since it uses less digits than its factorization.
1101426464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20997 (or 20989 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 29.
The square root of 1101426464 is about 33187.7456902393. The cubic root of 1101426464 is about 1032.7261379930.
Adding to 1101426464 its reverse (4646241011), we get a palindrome (5747667475).
The spelling of 1101426464 in words is "one billion, one hundred one million, four hundred twenty-six thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •