Base | Representation |
---|---|
bin | 10010111000000001… |
… | …10111010110111100 |
3 | 222011020021112022210 |
4 | 21130000313112330 |
5 | 131223204241322 |
6 | 4353315340420 |
7 | 506056506306 |
oct | 113400672674 |
9 | 28136245283 |
10 | 10133665212 |
11 | 433020a730 |
12 | 1b698b1710 |
13 | c565ba308 |
14 | 6c1bd8976 |
15 | 3e49b270c |
hex | 25c0375bc |
10133665212 has 24 divisors (see below), whose sum is σ = 25794784512. Its totient is φ = 3070807600.
The previous prime is 10133665187. The next prime is 10133665279. The reversal of 10133665212 is 21256633101.
10133665212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 10133665212.
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 7 ways as a sum of consecutive naturals, for example, 38384964 + ... + 38385227.
It is an arithmetic number, because the mean of its divisors is an integer number (1074782688).
Almost surely, 210133665212 is an apocalyptic number.
10133665212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10133665212 is an abundant number, since it is smaller than the sum of its proper divisors (15661119300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10133665212 is a wasteful number, since it uses less digits than its factorization.
10133665212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76770209 (or 76770207 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
The spelling of 10133665212 in words is "ten billion, one hundred thirty-three million, six hundred sixty-five thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •