Base | Representation |
---|---|
bin | 11101111100110101111… |
… | …11000010010010010000 |
3 | 10122101021120022110122210 |
4 | 32332122333002102100 |
5 | 113330042413240230 |
6 | 2104432200432120 |
7 | 134230664365245 |
oct | 16763277022220 |
9 | 3571246273583 |
10 | 1029097399440 |
11 | 36748a720850 |
12 | 147542778640 |
13 | 76074666666 |
14 | 37b46a595cc |
15 | 1bb80eeceb0 |
hex | ef9afc2490 |
1029097399440 has 320 divisors, whose sum is σ = 3539961999360. Its totient is φ = 245223813120.
The previous prime is 1029097399433. The next prime is 1029097399441. The reversal of 1029097399440 is 449937909201.
It is not an unprimeable number, because it can be changed into a prime (1029097399441) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 47332252 + ... + 47353988.
It is an arithmetic number, because the mean of its divisors is an integer number (11062381248).
Almost surely, 21029097399440 is an apocalyptic number.
1029097399440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1029097399440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1769980999680).
1029097399440 is an abundant number, since it is smaller than the sum of its proper divisors (2510864599920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1029097399440 is a wasteful number, since it uses less digits than its factorization.
1029097399440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22070 (or 22064 counting only the distinct ones).
The product of its (nonzero) digits is 4408992, while the sum is 57.
The spelling of 1029097399440 in words is "one trillion, twenty-nine billion, ninety-seven million, three hundred ninety-nine thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •