Base | Representation |
---|---|
bin | 110111111000100110… |
… | …0000111111000100000 |
3 | 102110202202010100112120 |
4 | 1233301030013320200 |
5 | 3431240203312224 |
6 | 131044311424240 |
7 | 11445655206021 |
oct | 1576114077040 |
9 | 373682110476 |
10 | 120010604064 |
11 | 4699494810a |
12 | 1b313385080 |
13 | b41745ab70 |
14 | 5b46906c48 |
15 | 31c5d9c779 |
hex | 1bf1307e20 |
120010604064 has 192 divisors, whose sum is σ = 349772411520. Its totient is φ = 35793838080.
The previous prime is 120010604053. The next prime is 120010604069. The reversal of 120010604064 is 460406010021.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (120010604069) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8025907 + ... + 8040845.
It is an arithmetic number, because the mean of its divisors is an integer number (1821731310).
Almost surely, 2120010604064 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 120010604064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (174886205760).
120010604064 is an abundant number, since it is smaller than the sum of its proper divisors (229761807456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120010604064 is a wasteful number, since it uses less digits than its factorization.
120010604064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15163 (or 15155 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 120010604064 its reverse (460406010021), we get a palindrome (580416614085).
The spelling of 120010604064 in words is "one hundred twenty billion, ten million, six hundred four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •