Base | Representation |
---|---|
bin | 11111000111111100111… |
… | …01111001111100101000 |
3 | 10210020100210112211012001 |
4 | 33203332131321330220 |
5 | 120010133303014200 |
6 | 2135141342300344 |
7 | 140156152502314 |
oct | 17437635717450 |
9 | 3706323484161 |
10 | 1069421141800 |
11 | 3825a239a260 |
12 | 153316b876b4 |
13 | 79acc80a63b |
14 | 39a9021ab44 |
15 | 1cc4113376a |
hex | f8fe779f28 |
1069421141800 has 48 divisors (see below), whose sum is σ = 2712440901600. Its totient is φ = 388880414400.
The previous prime is 1069421141791. The next prime is 1069421141801. The reversal of 1069421141800 is 81411249601.
It is a super-2 number, since 2×10694211418002 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1069421141800.
It is not an unprimeable number, because it can be changed into a prime (1069421141801) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 243048060 + ... + 243052459.
It is an arithmetic number, because the mean of its divisors is an integer number (56509185450).
Almost surely, 21069421141800 is an apocalyptic number.
1069421141800 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1069421141800 is an abundant number, since it is smaller than the sum of its proper divisors (1643019759800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1069421141800 is a wasteful number, since it uses less digits than its factorization.
1069421141800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 486100546 (or 486100537 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 37.
The spelling of 1069421141800 in words is "one trillion, sixty-nine billion, four hundred twenty-one million, one hundred forty-one thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •