Base | Representation |
---|---|
bin | 1010010011100011101111… |
… | …1111000011010000100110 |
3 | 1111010020121221101012022010 |
4 | 2210320323333003100212 |
5 | 2441122123302023024 |
6 | 40033241015015050 |
7 | 2246434652531100 |
oct | 244707377032046 |
9 | 44106557335263 |
10 | 11331130111014 |
11 | 367956160038a |
12 | 133007066a486 |
13 | 6426a07ac09c |
14 | 2b2602c5c570 |
15 | 149b36cc4b29 |
hex | a4e3bfc3426 |
11331130111014 has 48 divisors (see below), whose sum is σ = 26362515393648. Its totient is φ = 3237429601728.
The previous prime is 11331130110973. The next prime is 11331130111031. The reversal of 11331130111014 is 41011103113311.
It is a Harshad number since it is a multiple of its sum of digits (21).
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 23 ways as a sum of consecutive naturals, for example, 37225524 + ... + 37528680.
It is an arithmetic number, because the mean of its divisors is an integer number (549219070701).
Almost surely, 211331130111014 is an apocalyptic number.
11331130111014 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
11331130111014 is an abundant number, since it is smaller than the sum of its proper divisors (15031385282634).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331130111014 is a wasteful number, since it uses less digits than its factorization.
11331130111014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430309 (or 430302 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 11331130111014 its reverse (41011103113311), we get a palindrome (52342233224325).
The spelling of 11331130111014 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty million, one hundred eleven thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •