Base | Representation |
---|---|
bin | 10011111100000111… |
… | …00100110111010000 |
3 | 1000122000222020122201 |
4 | 21332003210313100 |
5 | 133410412114412 |
6 | 4530121012544 |
7 | 526163211016 |
oct | 117603446720 |
9 | 30560866581 |
10 | 10704801232 |
11 | 45a3643674 |
12 | 20a9024154 |
13 | 1017a1b018 |
14 | 7379ca8b6 |
15 | 429bcce57 |
hex | 27e0e4dd0 |
10704801232 has 20 divisors (see below), whose sum is σ = 20745028260. Its totient is φ = 5351245568.
The previous prime is 10704801203. The next prime is 10704801241. The reversal of 10704801232 is 23210840701.
10704801232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9251361856 + 1453439376 = 96184^2 + 38124^2 .
It is a super-2 number, since 2×107048012322 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10704801232.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6894 + ... + 146482.
It is an arithmetic number, because the mean of its divisors is an integer number (1037251413).
Almost surely, 210704801232 is an apocalyptic number.
It is an amenable number.
10704801232 is a deficient number, since it is larger than the sum of its proper divisors (10040227028).
10704801232 is a wasteful number, since it uses less digits than its factorization.
10704801232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144390 (or 144384 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 28.
The spelling of 10704801232 in words is "ten billion, seven hundred four million, eight hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •