Base | Representation |
---|---|
bin | 101111000101000111… |
… | …0100110011100100110 |
3 | 100122222001202100222220 |
4 | 1132022032212130212 |
5 | 3124024423043420 |
6 | 114240215133210 |
7 | 10206302064165 |
oct | 1361216463446 |
9 | 318861670886 |
10 | 101103331110 |
11 | 399722160a1 |
12 | 17717374206 |
13 | 96c32886a2 |
14 | 4c717c93dc |
15 | 296b02c840 |
hex | 178a3a6726 |
101103331110 has 32 divisors (see below), whose sum is σ = 243663275520. Its totient is φ = 26848079328.
The previous prime is 101103331097. The next prime is 101103331129. The reversal of 101103331110 is 11133301101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101103331110.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7043272 + ... + 7057611.
It is an arithmetic number, because the mean of its divisors is an integer number (7614477360).
Almost surely, 2101103331110 is an apocalyptic number.
101103331110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101103331110 is an abundant number, since it is smaller than the sum of its proper divisors (142559944410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101103331110 is a wasteful number, since it uses less digits than its factorization.
101103331110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14101132.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 101103331110 its reverse (11133301101), we get a palindrome (112236632211).
The spelling of 101103331110 in words is "one hundred one billion, one hundred three million, three hundred thirty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •