Base | Representation |
---|---|
bin | 10010110100000011… |
… | …01000110011100000 |
3 | 222001220112002010020 |
4 | 21122001220303200 |
5 | 131141140011222 |
6 | 4350124433440 |
7 | 505203150405 |
oct | 113201506340 |
9 | 28056462106 |
10 | 10100313312 |
11 | 43133aa981 |
12 | 1b5a6a8880 |
13 | c4c71076b |
14 | 6bb5d62ac |
15 | 3e1ac565c |
hex | 25a068ce0 |
10100313312 has 24 divisors (see below), whose sum is σ = 26513322696. Its totient is φ = 3366771072.
The previous prime is 10100313263. The next prime is 10100313331. The reversal of 10100313312 is 21331300101.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 10100313291 and 10100313300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52605703 + ... + 52605894.
It is an arithmetic number, because the mean of its divisors is an integer number (1104721779).
Almost surely, 210100313312 is an apocalyptic number.
10100313312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10100313312 is an abundant number, since it is smaller than the sum of its proper divisors (16413009384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100313312 is a wasteful number, since it uses less digits than its factorization.
10100313312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105211610 (or 105211602 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 10100313312 its reverse (21331300101), we get a palindrome (31431613413).
The spelling of 10100313312 in words is "ten billion, one hundred million, three hundred thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •