Base | Representation |
---|---|
bin | 11001000010001010101111… |
… | …010000011111100100110110 |
3 | 112102211110200111120112012112 |
4 | 121002022233100133210312 |
5 | 103412340032243031402 |
6 | 1030055145152051022 |
7 | 32122320623505044 |
oct | 3102125720374466 |
9 | 472743614515175 |
10 | 110100132002102 |
11 | 32099227235440 |
12 | 10422187533a72 |
13 | 495852324aa48 |
14 | 1d28c36723394 |
15 | cade55323e52 |
hex | 6422af41f936 |
110100132002102 has 64 divisors (see below), whose sum is σ = 184712910520320. Its totient is φ = 48783950323200.
The previous prime is 110100132002093. The next prime is 110100132002123. The reversal of 110100132002102 is 201200231001011.
It is a super-4 number, since 4×1101001320021024 (a number of 57 digits) contains 4444 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 11190170099 + ... + 11190179937.
It is an arithmetic number, because the mean of its divisors is an integer number (2886139226880).
Almost surely, 2110100132002102 is an apocalyptic number.
110100132002102 is a deficient number, since it is larger than the sum of its proper divisors (74612778518218).
110100132002102 is a wasteful number, since it uses less digits than its factorization.
110100132002102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19037.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 110100132002102 its reverse (201200231001011), we get a palindrome (311300363003113).
The spelling of 110100132002102 in words is "one hundred ten trillion, one hundred billion, one hundred thirty-two million, two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •