Base | Representation |
---|---|
bin | 1001001100011111011110… |
… | …0110000111011111011000 |
3 | 1022210112020001120112222110 |
4 | 2103013313212013133120 |
5 | 2311121203233340432 |
6 | 33300322310552320 |
7 | 2062303323111441 |
oct | 223076746073730 |
9 | 38715201515873 |
10 | 10110212011992 |
11 | 3248798120954 |
12 | 11735156686a0 |
13 | 584509556cc1 |
14 | 26d4a05402c8 |
15 | 127eca968dcc |
hex | 931f79877d8 |
10110212011992 has 32 divisors (see below), whose sum is σ = 26374466119680. Its totient is φ = 3223545858720.
The previous prime is 10110212011973. The next prime is 10110212012041. The reversal of 10110212011992 is 29911021201101.
It is a super-3 number, since 3×101102120119923 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9157800184 + ... + 9157801287.
It is an arithmetic number, because the mean of its divisors is an integer number (824202066240).
Almost surely, 210110212011992 is an apocalyptic number.
10110212011992 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10110212011992 is an abundant number, since it is smaller than the sum of its proper divisors (16264254107688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110212011992 is a wasteful number, since it uses less digits than its factorization.
10110212011992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18315601503 (or 18315601499 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 30.
The spelling of 10110212011992 in words is "ten trillion, one hundred ten billion, two hundred twelve million, eleven thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •