Base | Representation |
---|---|
bin | 10000011100100110000… |
… | …001110101001011011100 |
3 | 11000001021120210222110211 |
4 | 100130212001311023130 |
5 | 122004134342204040 |
6 | 2223114025142204 |
7 | 144440524000150 |
oct | 20344601651334 |
9 | 4001246728424 |
10 | 1130214413020 |
11 | 3a6359631770 |
12 | 16306262a964 |
13 | 8276a702a84 |
14 | 3c9ba1a7060 |
15 | 1e5ed32e8ea |
hex | 107260752dc |
1130214413020 has 48 divisors (see below), whose sum is σ = 2959106830848. Its totient is φ = 352274621760.
The previous prime is 1130214413011. The next prime is 1130214413051. The reversal of 1130214413020 is 203144120311.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 1130214412982 and 1130214413000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 366951192 + ... + 366954271.
It is an arithmetic number, because the mean of its divisors is an integer number (61648058976).
Almost surely, 21130214413020 is an apocalyptic number.
1130214413020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1130214413020 is an abundant number, since it is smaller than the sum of its proper divisors (1828892417828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130214413020 is a wasteful number, since it uses less digits than its factorization.
1130214413020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 733905490 (or 733905488 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 1130214413020 its reverse (203144120311), we get a palindrome (1333358533331).
The spelling of 1130214413020 in words is "one trillion, one hundred thirty billion, two hundred fourteen million, four hundred thirteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •