Base | Representation |
---|---|
bin | 10010101100111000… |
… | …01010001011011100 |
3 | 221220201022211000200 |
4 | 21112130022023130 |
5 | 131030240010032 |
6 | 4340135223500 |
7 | 503542632303 |
oct | 112634121334 |
9 | 27821284020 |
10 | 10040156892 |
11 | 4292452527 |
12 | 1b42517b90 |
13 | c4010a54c |
14 | 6b361743a |
15 | 3db69147c |
hex | 25670a2dc |
10040156892 has 18 divisors (see below), whose sum is σ = 25379285568. Its totient is φ = 3346718952.
The previous prime is 10040156891. The next prime is 10040156911. The reversal of 10040156892 is 29865104001.
10040156892 is a `hidden beast` number, since 1 + 0 + 0 + 4 + 0 + 1 + 568 + 92 = 666.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 278893247 = 10040156892 / (1 + 0 + 0 + 4 + 0 + 1 + 5 + 6 + 8 + 9 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10040156891) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 139446588 + ... + 139446659.
Almost surely, 210040156892 is an apocalyptic number.
10040156892 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10040156892 is an abundant number, since it is smaller than the sum of its proper divisors (15339128676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10040156892 is a wasteful number, since it uses less digits than its factorization.
10040156892 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 278893257 (or 278893252 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The spelling of 10040156892 in words is "ten billion, forty million, one hundred fifty-six thousand, eight hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •