Base | Representation |
---|---|
bin | 10011111100001001… |
… | …10101000100001100 |
3 | 1000122001120221021200 |
4 | 21332010311010030 |
5 | 133411003122430 |
6 | 4530132025500 |
7 | 526166046534 |
oct | 117604650414 |
9 | 30561527250 |
10 | 10705129740 |
11 | 45a3848468 |
12 | 20a9162290 |
13 | 1017b046c6 |
14 | 737a744c4 |
15 | 429c45460 |
hex | 27e13510c |
10705129740 has 72 divisors (see below), whose sum is σ = 33084939888. Its totient is φ = 2800836480.
The previous prime is 10705129733. The next prime is 10705129751. The reversal of 10705129740 is 4792150701.
It is a happy number.
10705129740 is a `hidden beast` number, since 1 + 0 + 70 + 512 + 9 + 74 + 0 = 666.
It is a super-2 number, since 2×107051297402 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 10705129695 and 10705129704.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 551526 + ... + 570605.
It is an arithmetic number, because the mean of its divisors is an integer number (459513054).
Almost surely, 210705129740 is an apocalyptic number.
10705129740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10705129740 is an abundant number, since it is smaller than the sum of its proper divisors (22379810148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10705129740 is a wasteful number, since it uses less digits than its factorization.
10705129740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1122199 (or 1122194 counting only the distinct ones).
The product of its (nonzero) digits is 17640, while the sum is 36.
The spelling of 10705129740 in words is "ten billion, seven hundred five million, one hundred twenty-nine thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •