Base | Representation |
---|---|
bin | 10010111111111011… |
… | …10101101110100000 |
3 | 222022212001201102121 |
4 | 21133331311232200 |
5 | 131342143342320 |
6 | 4404044554024 |
7 | 510523256551 |
oct | 113775655640 |
9 | 28285051377 |
10 | 10199980960 |
11 | 4364694734 |
12 | 1b87b52914 |
13 | c67268bc0 |
14 | 6ca93c328 |
15 | 3ea7118aa |
hex | 25ff75ba0 |
10199980960 has 96 divisors (see below), whose sum is σ = 27477736272. Its totient is φ = 3544596480.
The previous prime is 10199980951. The next prime is 10199980961. The reversal of 10199980960 is 6908999101.
It can be written as a sum of positive squares in 8 ways, for example, as 963233296 + 9236747664 = 31036^2 + 96108^2 .
It is a super-2 number, since 2×101999809602 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a junction number, because it is equal to n+sod(n) for n = 10199980898 and 10199980907.
It is not an unprimeable number, because it can be changed into a prime (10199980961) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 108871 + ... + 179590.
Almost surely, 210199980960 is an apocalyptic number.
10199980960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10199980960 is an abundant number, since it is smaller than the sum of its proper divisors (17277755312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10199980960 is a wasteful number, since it uses less digits than its factorization.
10199980960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288506 (or 288498 counting only the distinct ones).
The product of its (nonzero) digits is 314928, while the sum is 52.
The spelling of 10199980960 in words is "ten billion, one hundred ninety-nine million, nine hundred eighty thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •