Base | Representation |
---|---|
bin | 1001001100100110001111… |
… | …1110010111111001110000 |
3 | 1022210200220210000122221010 |
4 | 2103021203332113321300 |
5 | 2311133414224410000 |
6 | 33301222543230520 |
7 | 2062366352306013 |
oct | 223114376277160 |
9 | 38720823018833 |
10 | 10112030310000 |
11 | 3249540543083 |
12 | 11739425a8440 |
13 | 584739182898 |
14 | 26d5d3c1b37a |
15 | 1280853d8d50 |
hex | 93263f97e70 |
10112030310000 has 100 divisors (see below), whose sum is σ = 32642982208232. Its totient is φ = 2696541408000.
The previous prime is 10112030309981. The next prime is 10112030310049. The reversal of 10112030310000 is 1303021101.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×101120303100002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 168503839 + ... + 168563838.
Almost surely, 210112030310000 is an apocalyptic number.
10112030310000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10112030310000 is an abundant number, since it is smaller than the sum of its proper divisors (22530951898232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112030310000 is an equidigital number, since it uses as much as digits as its factorization.
10112030310000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 337067708 (or 337067687 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 10112030310000 its reverse (1303021101), we get a palindrome (10113333331101).
The spelling of 10112030310000 in words is "ten trillion, one hundred twelve billion, thirty million, three hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •