Base | Representation |
---|---|
bin | 10100010001010100001… |
… | …010111111000111010000 |
3 | 11221011112021120121111000 |
4 | 110101110022333013100 |
5 | 140310311240220000 |
6 | 2543532113222000 |
7 | 202432244661006 |
oct | 24212412770720 |
9 | 4834467517430 |
10 | 1392981570000 |
11 | 49783a865a19 |
12 | 1a5b76861900 |
13 | a148584a307 |
14 | 4b5c6452a76 |
15 | 2637be05000 |
hex | 144542bf1d0 |
1392981570000 has 400 divisors, whose sum is σ = 5001984852480. Its totient is φ = 371044224000.
The previous prime is 1392981569999. The next prime is 1392981570031. The reversal of 1392981570000 is 751892931.
It is a tau number, because it is divible by the number of its divisors (400).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 296187649 + ... + 296192351.
Almost surely, 21392981570000 is an apocalyptic number.
1392981570000 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 1392981570000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2500992426240).
1392981570000 is an abundant number, since it is smaller than the sum of its proper divisors (3609003282480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1392981570000 is a wasteful number, since it uses less digits than its factorization.
1392981570000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5837 (or 5810 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 45.
The spelling of 1392981570000 in words is "one trillion, three hundred ninety-two billion, nine hundred eighty-one million, five hundred seventy thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •