Base | Representation |
---|---|
bin | 11001010010011110111011… |
… | …110111100000011010100000 |
3 | 112120210122200201110011210021 |
4 | 121102132323313200122200 |
5 | 104034222240441120000 |
6 | 1032314212412443224 |
7 | 32266322145431044 |
oct | 3122367367403240 |
9 | 476718621404707 |
10 | 111221330020000 |
11 | 32490779297a92 |
12 | 10583532479514 |
13 | 4a0a18497cb75 |
14 | 1d671d9248024 |
15 | ccd1c6cd911a |
hex | 6527bbde06a0 |
111221330020000 has 60 divisors (see below), whose sum is σ = 273621155097906. Its totient is φ = 44488532000000.
The previous prime is 111221330019983. The next prime is 111221330020057. The reversal of 111221330020000 is 20033122111.
It can be written as a sum of positive squares in 5 ways, for example, as 15949128500496 + 95272201519504 = 3993636^2 + 9760748^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2780513251 + ... + 2780553250.
Almost surely, 2111221330020000 is an apocalyptic number.
111221330020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111221330020000 is an abundant number, since it is smaller than the sum of its proper divisors (162399825077906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111221330020000 is an frugal number, since it uses more digits than its factorization.
111221330020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5561066531 (or 5561066508 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 111221330020000 its reverse (20033122111), we get a palindrome (111241363142111).
The spelling of 111221330020000 in words is "one hundred eleven trillion, two hundred twenty-one billion, three hundred thirty million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •