Base | Representation |
---|---|
bin | 110011110010011010… |
… | …0011000101000010100 |
3 | 101122001122002212012012 |
4 | 1213210310120220110 |
5 | 3310231024320040 |
6 | 123031323043352 |
7 | 11014651631342 |
oct | 1474464305024 |
9 | 348048085165 |
10 | 111213120020 |
11 | 4318a9a8142 |
12 | 19679070558 |
13 | a6449360c2 |
14 | 555036a992 |
15 | 2d5d875865 |
hex | 19e4d18a14 |
111213120020 has 12 divisors (see below), whose sum is σ = 233547552084. Its totient is φ = 44485248000.
The previous prime is 111213120019. The next prime is 111213120049. The reversal of 111213120020 is 20021312111.
It can be written as a sum of positive squares in 2 ways, for example, as 70685793424 + 40527326596 = 265868^2 + 201314^2 .
It is a junction number, because it is equal to n+sod(n) for n = 111213119977 and 111213120004.
It is a congruent number.
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, 2780327981 + ... + 2780328020.
It is an arithmetic number, because the mean of its divisors is an integer number (19462296007).
Almost surely, 2111213120020 is an apocalyptic number.
111213120020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111213120020 is an abundant number, since it is smaller than the sum of its proper divisors (122334432064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111213120020 is a wasteful number, since it uses less digits than its factorization.
111213120020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5560656010 (or 5560656008 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 111213120020 its reverse (20021312111), we get a palindrome (131234432131).
The spelling of 111213120020 in words is "one hundred eleven billion, two hundred thirteen million, one hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •