Base | Representation |
---|---|
bin | 11001000011110001010001… |
… | …000001010001000111010011 |
3 | 112110012222211201202110001110 |
4 | 121003301101001101013103 |
5 | 103421141012321231344 |
6 | 1030221513130104403 |
7 | 32133265665065565 |
oct | 3103612101210723 |
9 | 473188751673043 |
10 | 110210220102099 |
11 | 3213098a089367 |
12 | 1043b58b87b103 |
13 | 4965a18a82b10 |
14 | 1d302bb4bb335 |
15 | cb1c4a0203b9 |
hex | 643c510511d3 |
110210220102099 has 8 divisors (see below), whose sum is σ = 158250572454352. Its totient is φ = 67821673908960.
The previous prime is 110210220102041. The next prime is 110210220102107. The reversal of 110210220102099 is 990201022012011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110210220102099 - 212 = 110210220098003 is a prime.
It is a super-2 number, since 2×1102102201020992 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110210220602099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1412951539732 + ... + 1412951539809.
It is an arithmetic number, because the mean of its divisors is an integer number (19781321556794).
Almost surely, 2110210220102099 is an apocalyptic number.
110210220102099 is a deficient number, since it is larger than the sum of its proper divisors (48040352352253).
110210220102099 is a wasteful number, since it uses less digits than its factorization.
110210220102099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2825903079557.
The product of its (nonzero) digits is 1296, while the sum is 30.
The spelling of 110210220102099 in words is "one hundred ten trillion, two hundred ten billion, two hundred twenty million, one hundred two thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •