Base | Representation |
---|---|
bin | 10010111001010110… |
… | …00101101110010100 |
3 | 222012000002212222121 |
4 | 21130223011232110 |
5 | 131234022442400 |
6 | 4354352505324 |
7 | 506252550154 |
oct | 113453055624 |
9 | 28160085877 |
10 | 10144734100 |
11 | 433648a976 |
12 | 1b7154b244 |
13 | c58994557 |
14 | 6c347a764 |
15 | 3e594c21a |
hex | 25cac5b94 |
10144734100 has 18 divisors (see below), whose sum is σ = 22014073214. Its totient is φ = 4057893600.
The previous prime is 10144734073. The next prime is 10144734113. The reversal of 10144734100 is 143744101.
It is a happy number.
10144734100 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 3 ways, for example, as 99082116 + 10045651984 = 9954^2 + 100228^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
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 5 ways as a sum of consecutive naturals, for example, 50723571 + ... + 50723770.
Almost surely, 210144734100 is an apocalyptic number.
10144734100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10144734100 is an abundant number, since it is smaller than the sum of its proper divisors (11869339114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10144734100 is a wasteful number, since it uses less digits than its factorization.
10144734100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101447355 (or 101447348 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 25.
The spelling of 10144734100 in words is "ten billion, one hundred forty-four million, seven hundred thirty-four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •