Base | Representation |
---|---|
bin | 11001000010001011100100… |
… | …001100000011110000000010 |
3 | 112102211112222101120010012211 |
4 | 121002023210030003300002 |
5 | 103412343342112011002 |
6 | 1030055413233412334 |
7 | 32122351625600356 |
oct | 3102134414036002 |
9 | 472745871503184 |
10 | 110101020032002 |
11 | 3209964253144a |
12 | 10422394a0a0aa |
13 | 4958635212c1c |
14 | 1d28cbc645466 |
15 | cadea8288dd7 |
hex | 6422e4303c02 |
110101020032002 has 8 divisors (see below), whose sum is σ = 165427242120000. Its totient is φ = 54958605992004.
The previous prime is 110101020031997. The next prime is 110101020032021. The reversal of 110101020032002 is 200230020101011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1101010200320022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45952010502 + ... + 45952012897.
It is an arithmetic number, because the mean of its divisors is an integer number (20678405265000).
Almost surely, 2110101020032002 is an apocalyptic number.
110101020032002 is a deficient number, since it is larger than the sum of its proper divisors (55326222087998).
110101020032002 is an equidigital number, since it uses as much as digits as its factorization.
110101020032002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91904024000.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 110101020032002 its reverse (200230020101011), we get a palindrome (310331040133013).
The spelling of 110101020032002 in words is "one hundred ten trillion, one hundred one billion, twenty million, thirty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •