Base | Representation |
---|---|
bin | 110011001110010000… |
… | …0101111011011111010 |
3 | 101111221002102112110120 |
4 | 1212130200233123322 |
5 | 3300240000323002 |
6 | 122311105554110 |
7 | 10642621444350 |
oct | 1463440573372 |
9 | 344832375416 |
10 | 110000011002 |
11 | 42718158402 |
12 | 1939a945936 |
13 | a4b0501c0b |
14 | 54771c77d0 |
15 | 2cdc0eacbc |
hex | 199c82f6fa |
110000011002 has 128 divisors (see below), whose sum is σ = 270458486784. Its totient is φ = 29146231488.
The previous prime is 110000010961. The next prime is 110000011007. The reversal of 110000011002 is 200110000011.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is not an unprimeable number, because it can be changed into a prime (110000011007) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4846693 + ... + 4869335.
It is an arithmetic number, because the mean of its divisors is an integer number (2112956928).
Almost surely, 2110000011002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110000011002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135229243392).
110000011002 is an abundant number, since it is smaller than the sum of its proper divisors (160458475782).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110000011002 is a wasteful number, since it uses less digits than its factorization.
110000011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22832.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 110000011002 its reverse (200110000011), we get a palindrome (310110011013).
The spelling of 110000011002 in words is "one hundred ten billion, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •