Base | Representation |
---|---|
bin | 100011110010110… |
… | …1110111000000000 |
3 | 10002201000212022210 |
4 | 1013211232320000 |
5 | 4424433324124 |
6 | 315103102120 |
7 | 41522646330 |
oct | 10745567000 |
9 | 3081025283 |
10 | 1201073664 |
11 | 566a7a46a |
12 | 2962a1940 |
13 | 161aac09b |
14 | b572d0c0 |
15 | 7069da29 |
hex | 4796ee00 |
1201073664 has 160 divisors (see below), whose sum is σ = 3872537856. Its totient is φ = 322928640.
The previous prime is 1201073663. The next prime is 1201073669. The reversal of 1201073664 is 4663701021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201073663) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 179499 + ... + 186069.
Almost surely, 21201073664 is an apocalyptic number.
1201073664 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1201073664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1936268928).
1201073664 is an abundant number, since it is smaller than the sum of its proper divisors (2671464192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201073664 is an equidigital number, since it uses as much as digits as its factorization.
1201073664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6616 (or 6600 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 30.
The square root of 1201073664 is about 34656.5096915428. The cubic root of 1201073664 is about 1062.9754020008.
Adding to 1201073664 its reverse (4663701021), we get a palindrome (5864774685).
The spelling of 1201073664 in words is "one billion, two hundred one million, seventy-three thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •