Base | Representation |
---|---|
bin | 11001000010010101111110… |
… | …100100101000100010101010 |
3 | 112102212121211112211102022201 |
4 | 121002111332210220202222 |
5 | 103413034241211200020 |
6 | 1030104502453210414 |
7 | 32123225652604003 |
oct | 3102257644504252 |
9 | 472777745742281 |
10 | 110112200100010 |
11 | 320a335a378a79 |
12 | 10424595030a0a |
13 | 49596c7536394 |
14 | 1d2965d3ca1aa |
15 | cae40ea46a0a |
hex | 64257e9288aa |
110112200100010 has 16 divisors (see below), whose sum is σ = 206819436710016. Its totient is φ = 42129885255568.
The previous prime is 110112200099933. The next prime is 110112200100031. The reversal of 110112200100010 is 10001002211011.
It is a super-2 number, since 2×1101122001000102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a self number, because there is not a number n which added to its sum of digits gives 110112200100010.
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, 239374347814 + ... + 239374348273.
It is an arithmetic number, because the mean of its divisors is an integer number (12926214794376).
Almost surely, 2110112200100010 is an apocalyptic number.
110112200100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110112200100010 is a deficient number, since it is larger than the sum of its proper divisors (96707236610006).
110112200100010 is a wasteful number, since it uses less digits than its factorization.
110112200100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478748696117.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110112200100010 its reverse (10001002211011), we get a palindrome (120113202311021).
The spelling of 110112200100010 in words is "one hundred ten trillion, one hundred twelve billion, two hundred million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •