Base | Representation |
---|---|
bin | 1011000110001100101011… |
… | …0101000010001111111010 |
3 | 1121012102012100001200222222 |
4 | 2301203022311002033322 |
5 | 3044400333131133424 |
6 | 41541040151444042 |
7 | 2366333611000460 |
oct | 261431265021772 |
9 | 47172170050888 |
10 | 12201110021114 |
11 | 3984509585323 |
12 | 14507a7086622 |
13 | 6a673798aa91 |
14 | 30277328a830 |
15 | 1625a3a59e5e |
hex | b18cad423fa |
12201110021114 has 8 divisors (see below), whose sum is σ = 20916188607648. Its totient is φ = 5229047151900.
The previous prime is 12201110021101. The next prime is 12201110021143. The reversal of 12201110021114 is 41112001110221.
12201110021114 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 12201110021092 and 12201110021101.
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, 435753929312 + ... + 435753929339.
It is an arithmetic number, because the mean of its divisors is an integer number (2614523575956).
Almost surely, 212201110021114 is an apocalyptic number.
12201110021114 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
12201110021114 is a deficient number, since it is larger than the sum of its proper divisors (8715078586534).
12201110021114 is an equidigital number, since it uses as much as digits as its factorization.
12201110021114 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 871507858660.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12201110021114 its reverse (41112001110221), we get a palindrome (53313111131335).
The spelling of 12201110021114 in words is "twelve trillion, two hundred one billion, one hundred ten million, twenty-one thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •