Base | Representation |
---|---|
bin | 10000000001100110011… |
… | …011111010010001110000 |
3 | 10220021110121221102212021 |
4 | 100001212123322101300 |
5 | 121020304414023100 |
6 | 2201522001241224 |
7 | 142363340266642 |
oct | 20014633722160 |
9 | 3807417842767 |
10 | 1101230220400 |
11 | 395035828872 |
12 | 159513933214 |
13 | 7cacb920b3b |
14 | 3b42aa22892 |
15 | 1d9a39aaa1a |
hex | 100666fa470 |
1101230220400 has 60 divisors (see below), whose sum is σ = 2760736306032. Its totient is φ = 421340254720.
The previous prime is 1101230220383. The next prime is 1101230220401. The reversal of 1101230220400 is 40220321011.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101230220401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 59840269 + ... + 59858668.
Almost surely, 21101230220400 is an apocalyptic number.
1101230220400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101230220400 is an abundant number, since it is smaller than the sum of its proper divisors (1659506085632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101230220400 is a wasteful number, since it uses less digits than its factorization.
1101230220400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119698978 (or 119698967 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 1101230220400 its reverse (40220321011), we get a palindrome (1141450541411).
The spelling of 1101230220400 in words is "one trillion, one hundred one billion, two hundred thirty million, two hundred twenty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •