Base | Representation |
---|---|
bin | 100001000000111… |
… | …1011000000000000 |
3 | 2212012112002000000 |
4 | 1002001323000000 |
5 | 4232044100224 |
6 | 301532000000 |
7 | 36311100540 |
oct | 10201730000 |
9 | 2765462000 |
10 | 1107800064 |
11 | 519362648 |
12 | 26b000000 |
13 | 1486820c7 |
14 | a71ad320 |
15 | 673c70c9 |
hex | 4207b000 |
1107800064 has 364 divisors, whose sum is σ = 3867593616. Its totient is φ = 310542336.
The previous prime is 1107800051. The next prime is 1107800081. The reversal of 1107800064 is 4600087011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 20901862 + ... + 20901914.
Almost surely, 21107800064 is an apocalyptic number.
1107800064 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 1107800064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1933796808).
1107800064 is an abundant number, since it is smaller than the sum of its proper divisors (2759793552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1107800064 is an frugal number, since it uses more digits than its factorization.
1107800064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102 (or 65 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The square root of 1107800064 is about 33283.6305711982. The cubic root of 1107800064 is about 1034.7143256941.
Adding to 1107800064 its reverse (4600087011), we get a palindrome (5707887075).
The spelling of 1107800064 in words is "one billion, one hundred seven million, eight hundred thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.077 sec. • engine limits •