Base | Representation |
---|---|
bin | 11001000010001010111001… |
… | …010001011011110101111001 |
3 | 112102211111010012201202221212 |
4 | 121002022321101123311321 |
5 | 103412340403301133423 |
6 | 1030055213553212505 |
7 | 32122325033603303 |
oct | 3102127121336571 |
9 | 472744105652855 |
10 | 110100300021113 |
11 | 32099303064626 |
12 | 10422213861135 |
13 | 495854bcb848c |
14 | 1d28c50b7c973 |
15 | cade64e62578 |
hex | 6422b945bd79 |
110100300021113 has 4 divisors (see below), whose sum is σ = 110100369540480. Its totient is φ = 110100230501748.
The previous prime is 110100300021077. The next prime is 110100300021119. The reversal of 110100300021113 is 311120003001011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110100300021113 - 228 = 110100031585657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110100300021119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32327345 + ... + 35570462.
It is an arithmetic number, because the mean of its divisors is an integer number (27525092385120).
Almost surely, 2110100300021113 is an apocalyptic number.
It is an amenable number.
110100300021113 is a deficient number, since it is larger than the sum of its proper divisors (69519367).
110100300021113 is an equidigital number, since it uses as much as digits as its factorization.
110100300021113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69519366.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 110100300021113 its reverse (311120003001011), we get a palindrome (421220303022124).
The spelling of 110100300021113 in words is "one hundred ten trillion, one hundred billion, three hundred million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •