Base | Representation |
---|---|
bin | 110011110010101001… |
… | …1100101101101001000 |
3 | 101122002012111110001220 |
4 | 1213211103211231020 |
5 | 3310240123100130 |
6 | 123032214242040 |
7 | 11015111310654 |
oct | 1474523455510 |
9 | 348065443056 |
10 | 111221300040 |
11 | 43194584994 |
12 | 1967b956320 |
13 | a64653b456 |
14 | 5551499a64 |
15 | 2d5e43e410 |
hex | 19e54e5b48 |
111221300040 has 64 divisors (see below), whose sum is σ = 333774432000. Its totient is φ = 29649188352.
The previous prime is 111221300039. The next prime is 111221300053. The reversal of 111221300040 is 40003122111.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 111221299992 and 111221300019.
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, 213889 + ... + 517871.
It is an arithmetic number, because the mean of its divisors is an integer number (5215225500).
Almost surely, 2111221300040 is an apocalyptic number.
111221300040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111221300040 is an abundant number, since it is smaller than the sum of its proper divisors (222553131960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111221300040 is a wasteful number, since it uses less digits than its factorization.
111221300040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307046 (or 307042 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 111221300040 its reverse (40003122111), we get a palindrome (151224422151).
The spelling of 111221300040 in words is "one hundred eleven billion, two hundred twenty-one million, three hundred thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •