Base | Representation |
---|---|
bin | 10000011100011010011… |
… | …101011100000001110000 |
3 | 11000000210001121012121212 |
4 | 100130122131130001300 |
5 | 122003240200322230 |
6 | 2223042453135252 |
7 | 144432646160261 |
oct | 20343235340160 |
9 | 4000701535555 |
10 | 1130020323440 |
11 | 3a626a016358 |
12 | 16300962a528 |
13 | 82739437a78 |
14 | 3c99c4c2968 |
15 | 1e5db291895 |
hex | 1071a75c070 |
1130020323440 has 40 divisors (see below), whose sum is σ = 2627343870480. Its totient is φ = 452000109056.
The previous prime is 1130020323437. The next prime is 1130020323491. The reversal of 1130020323440 is 443230200311.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 6763631 + ... + 6928689.
It is an arithmetic number, because the mean of its divisors is an integer number (65683596762).
Almost surely, 21130020323440 is an apocalyptic number.
1130020323440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1130020323440 is an abundant number, since it is smaller than the sum of its proper divisors (1497323547040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130020323440 is a wasteful number, since it uses less digits than its factorization.
1130020323440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250649 (or 250643 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 1130020323440 its reverse (443230200311), we get a palindrome (1573250523751).
The spelling of 1130020323440 in words is "one trillion, one hundred thirty billion, twenty million, three hundred twenty-three thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •