Base | Representation |
---|---|
bin | 11001000010001010111001… |
… | …010001011011110101111000 |
3 | 112102211111010012201202221211 |
4 | 121002022321101123311320 |
5 | 103412340403301133422 |
6 | 1030055213553212504 |
7 | 32122325033603302 |
oct | 3102127121336570 |
9 | 472744105652854 |
10 | 110100300021112 |
11 | 32099303064625 |
12 | 10422213861134 |
13 | 495854bcb848b |
14 | 1d28c50b7c972 |
15 | cade64e62577 |
hex | 6422b945bd78 |
110100300021112 has 64 divisors (see below), whose sum is σ = 218752326492480. Its totient is φ = 51771424438272.
The previous prime is 110100300021077. The next prime is 110100300021119. The reversal of 110100300021112 is 211120003001011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110100300021092 and 110100300021101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110100300021119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 921027298 + ... + 921146830.
It is an arithmetic number, because the mean of its divisors is an integer number (3418005101445).
Almost surely, 2110100300021112 is an apocalyptic number.
It is an amenable number.
110100300021112 is a deficient number, since it is larger than the sum of its proper divisors (108652026471368).
110100300021112 is a wasteful number, since it uses less digits than its factorization.
110100300021112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124792 (or 124788 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110100300021112 its reverse (211120003001011), we get a palindrome (321220303022123).
The spelling of 110100300021112 in words is "one hundred ten trillion, one hundred billion, three hundred million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •