Base | Representation |
---|---|
bin | 10101001000010010010… |
… | …111000001101001100000 |
3 | 12010210212212021201010000 |
4 | 111020102113001221200 |
5 | 142242202241101000 |
6 | 3031013124340000 |
7 | 206622041423064 |
oct | 25102227015140 |
9 | 5123785251100 |
10 | 1452006972000 |
11 | 50a87a09a092 |
12 | 1b54aa244600 |
13 | a6c013c24a0 |
14 | 503c56cbaa4 |
15 | 27b83ce3000 |
hex | 152125c1a60 |
1452006972000 has 960 divisors, whose sum is σ = 5873504180544. Its totient is φ = 349061529600.
The previous prime is 1452006971983. The next prime is 1452006972047. The reversal of 1452006972000 is 2796002541.
1452006972000 is a `hidden beast` number, since 1 + 4 + 520 + 0 + 69 + 72 + 0 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 181111992 + ... + 181120008.
Almost surely, 21452006972000 is an apocalyptic number.
1452006972000 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 1452006972000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2936752090272).
1452006972000 is an abundant number, since it is smaller than the sum of its proper divisors (4421497208544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1452006972000 is a wasteful number, since it uses less digits than its factorization.
1452006972000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8110 (or 8083 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The spelling of 1452006972000 in words is "one trillion, four hundred fifty-two billion, six million, nine hundred seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •