Base | Representation |
---|---|
bin | 10011111100010000… |
… | …10011100001000100 |
3 | 1000122010022020011100 |
4 | 21332020103201010 |
5 | 133411221302100 |
6 | 4530203340100 |
7 | 526206563142 |
oct | 117610234104 |
9 | 30563266140 |
10 | 10706040900 |
11 | 45a430aa95 |
12 | 20a9521630 |
13 | 1018063359 |
14 | 737c30592 |
15 | 429d75400 |
hex | 27e213844 |
10706040900 has 81 divisors (see below), whose sum is σ = 33567222871. Its totient is φ = 2854116480.
The previous prime is 10706040889. The next prime is 10706040907. The reversal of 10706040900 is 904060701.
The square root of 10706040900 is 103470.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 6096174084 + 4609866816 = 78078^2 + 67896^2 .
It is a super-2 number, since 2×107060409002 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10706040907) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 3102376 + ... + 3105824.
Almost surely, 210706040900 is an apocalyptic number.
10706040900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10706040900 is the 103470-th square number.
It is an amenable number.
10706040900 is an abundant number, since it is smaller than the sum of its proper divisors (22861181971).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10706040900 is an equidigital number, since it uses as much as digits as its factorization.
10706040900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6918 (or 3459 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The spelling of 10706040900 in words is "ten billion, seven hundred six million, forty thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •