Base | Representation |
---|---|
bin | 10011111111111000… |
… | …11010100100010000 |
3 | 1000201020120121200010 |
4 | 21333330122210100 |
5 | 133442014302410 |
6 | 4533211554520 |
7 | 530026363350 |
oct | 117774324420 |
9 | 30636517603 |
10 | 10736478480 |
11 | 460a50a212 |
12 | 20b775ba40 |
13 | 102145c560 |
14 | 73bcb4b60 |
15 | 42c888c20 |
hex | 27ff1a910 |
10736478480 has 320 divisors, whose sum is σ = 41082370560. Its totient is φ = 2258731008.
The previous prime is 10736478451. The next prime is 10736478553. The reversal of 10736478480 is 8487463701.
It is a super-2 number, since 2×107364784802 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12950706 + ... + 12951534.
It is an arithmetic number, because the mean of its divisors is an integer number (128382408).
Almost surely, 210736478480 is an apocalyptic number.
10736478480 is a gapful number since it is divisible by the number (10) 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 10736478480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20541185280).
10736478480 is an abundant number, since it is smaller than the sum of its proper divisors (30345892080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10736478480 is a wasteful number, since it uses less digits than its factorization.
10736478480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1458 (or 1452 counting only the distinct ones).
The product of its (nonzero) digits is 903168, while the sum is 48.
The spelling of 10736478480 in words is "ten billion, seven hundred thirty-six million, four hundred seventy-eight thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •