Base | Representation |
---|---|
bin | 11101011111110110001… |
… | …11001110110000000000 |
3 | 10120220002200001102201100 |
4 | 32233323013032300000 |
5 | 113101202223304300 |
6 | 2053335343334400 |
7 | 133140140221110 |
oct | 16577307166000 |
9 | 3526080042640 |
10 | 1013530291200 |
11 | 360921476a39 |
12 | 1445192b1400 |
13 | 74763499ccb |
14 | 370ab3b1040 |
15 | 1b56e516700 |
hex | ebfb1cec00 |
1013530291200 has 1584 divisors, whose sum is σ = 4390533987840. Its totient is φ = 218388234240.
The previous prime is 1013530291199. The next prime is 1013530291211. The reversal of 1013530291200 is 21920353101.
1013530291200 is a `hidden beast` number, since 1 + 0 + 1 + 3 + 530 + 2 + 9 + 120 + 0 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 3301401447 + ... + 3301401753.
It is an arithmetic number, because the mean of its divisors is an integer number (2771801760).
Almost surely, 21013530291200 is an apocalyptic number.
1013530291200 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 1013530291200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2195266993920).
1013530291200 is an abundant number, since it is smaller than the sum of its proper divisors (3377003696640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013530291200 is a wasteful number, since it uses less digits than its factorization.
1013530291200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462 (or 436 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The spelling of 1013530291200 in words is "one trillion, thirteen billion, five hundred thirty million, two hundred ninety-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •