Base | Representation |
---|---|
bin | 10011010000010001… |
… | …11100010010100100 |
3 | 222200102002112221200 |
4 | 21220020330102210 |
5 | 132132244443111 |
6 | 4425424042500 |
7 | 514106656323 |
oct | 115010742244 |
9 | 28612075850 |
10 | 10337109156 |
11 | 4425035120 |
12 | 2005a63430 |
13 | c897ac04a |
14 | 700c360ba |
15 | 40779c256 |
hex | 26823c4a4 |
10337109156 has 36 divisors (see below), whose sum is σ = 28505362704. Its totient is φ = 3132457200.
The previous prime is 10337109151. The next prime is 10337109161. The reversal of 10337109156 is 65190173301.
It is an interprime number because it is at equal distance from previous prime (10337109151) and next prime (10337109161).
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 10337109156.
It is not an unprimeable number, because it can be changed into a prime (10337109151) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 13051510 + ... + 13052301.
Almost surely, 210337109156 is an apocalyptic number.
It is an amenable number.
10337109156 is an abundant number, since it is smaller than the sum of its proper divisors (18168253548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10337109156 is a wasteful number, since it uses less digits than its factorization.
10337109156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26103832 (or 26103827 counting only the distinct ones).
The product of its (nonzero) digits is 17010, while the sum is 36.
The spelling of 10337109156 in words is "ten billion, three hundred thirty-seven million, one hundred nine thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •