Base | Representation |
---|---|
bin | 10000000001011000101… |
… | …110100100010011011110 |
3 | 10220020212121011201111101 |
4 | 100001120232210103132 |
5 | 121014322024330420 |
6 | 2201443103543314 |
7 | 142354545354214 |
oct | 20013056442336 |
9 | 3806777151441 |
10 | 1101000230110 |
11 | 394a27a21750 |
12 | 15946a8bab3a |
13 | 7ca93096101 |
14 | 3b408274cb4 |
15 | 1d98d6ca60a |
hex | 10058ba44de |
1101000230110 has 64 divisors (see below), whose sum is σ = 2181214946304. Its totient is φ = 396808070400.
The previous prime is 1101000230107. The next prime is 1101000230131. The reversal of 1101000230110 is 110320001011.
It is a super-2 number, since 2×11010002301102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9451279 + ... + 9567061.
It is an arithmetic number, because the mean of its divisors is an integer number (34081483536).
Almost surely, 21101000230110 is an apocalyptic number.
1101000230110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101000230110 is a deficient number, since it is larger than the sum of its proper divisors (1080214716194).
1101000230110 is a wasteful number, since it uses less digits than its factorization.
1101000230110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116569.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 1101000230110 its reverse (110320001011), we get a palindrome (1211320231121).
The spelling of 1101000230110 in words is "one trillion, one hundred one billion, two hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •