Base | Representation |
---|---|
bin | 10010101001010100… |
… | …10000111011010000 |
3 | 221211122010221020000 |
4 | 21110222100323100 |
5 | 131000114100422 |
6 | 4333151250000 |
7 | 503031101301 |
oct | 112452207320 |
9 | 27748127200 |
10 | 10010300112 |
11 | 427760a6aa |
12 | 1b34519900 |
13 | c36b85807 |
14 | 6ad6847a8 |
15 | 3d8c44cac |
hex | 254a90ed0 |
10010300112 has 50 divisors (see below), whose sum is σ = 28972716498. Its totient is φ = 3336766272.
The previous prime is 10010300107. The next prime is 10010300177. The reversal of 10010300112 is 21100301001.
It can be written as a sum of positive squares in only one way, i.e., 10008801936 + 1498176 = 100044^2 + 1224^2 .
It is a super-2 number, since 2×100103001122 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10010300094 and 10010300103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3860703 + ... + 3863294.
Almost surely, 210010300112 is an apocalyptic number.
10010300112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10010300112 is an abundant number, since it is smaller than the sum of its proper divisors (18962416386).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010300112 is an equidigital number, since it uses as much as digits as its factorization.
10010300112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7724017 (or 7724002 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 10010300112 its reverse (21100301001), we get a palindrome (31110601113).
The spelling of 10010300112 in words is "ten billion, ten million, three hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •