Base | Representation |
---|---|
bin | 11001000010001010101110… |
… | …100010101101100111101010 |
3 | 112102211110122122222210210100 |
4 | 121002022232202231213222 |
5 | 103412340021210013002 |
6 | 1030055144042530230 |
7 | 32122320416502315 |
oct | 3102125642554752 |
9 | 472743578883710 |
10 | 110100120001002 |
11 | 3209922048887a |
12 | 10422183506976 |
13 | 49585209083c1 |
14 | 1d28c34cbb97c |
15 | cade5425311c |
hex | 6422ae8ad9ea |
110100120001002 has 48 divisors (see below), whose sum is σ = 255649632376320. Its totient is φ = 34155618890976.
The previous prime is 110100120000961. The next prime is 110100120001007. The reversal of 110100120001002 is 200100021001011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (110100120001007) 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 23 ways as a sum of consecutive naturals, for example, 3593799802 + ... + 3593830437.
It is an arithmetic number, because the mean of its divisors is an integer number (5326034007840).
Almost surely, 2110100120001002 is an apocalyptic number.
110100120001002 is an abundant number, since it is smaller than the sum of its proper divisors (145549512375318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110100120001002 is a wasteful number, since it uses less digits than its factorization.
110100120001002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7187630307 (or 7187630304 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110100120001002 its reverse (200100021001011), we get a palindrome (310200141002013).
The spelling of 110100120001002 in words is "one hundred ten trillion, one hundred billion, one hundred twenty million, one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •