Base | Representation |
---|---|
bin | 10101001001010000110… |
… | …010101001011000000000 |
3 | 12010220120212012120012122 |
4 | 111021100302221120000 |
5 | 142301323411300000 |
6 | 3031305102343412 |
7 | 206660020420040 |
oct | 25112062513000 |
9 | 5126525176178 |
10 | 1453054400000 |
11 | 510267367265 |
12 | 1b5740b8ab68 |
13 | a703a3c7178 |
14 | 50484863720 |
15 | 27be5c42085 |
hex | 15250ca9600 |
1453054400000 has 240 divisors, whose sum is σ = 4147296243552. Its totient is φ = 498186240000.
The previous prime is 1453054399981. The next prime is 1453054400023. The reversal of 1453054400000 is 44503541.
It is a super-2 number, since 2×14530544000002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11135132 + ... + 11264868.
Almost surely, 21453054400000 is an apocalyptic number.
1453054400000 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 1453054400000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2073648121776).
1453054400000 is an abundant number, since it is smaller than the sum of its proper divisors (2694241843552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1453054400000 is an frugal number, since it uses more digits than its factorization.
1453054400000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129787 (or 129751 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 26.
Adding to 1453054400000 its reverse (44503541), we get a palindrome (1453098903541).
The spelling of 1453054400000 in words is "one trillion, four hundred fifty-three billion, fifty-four million, four hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •