Base | Representation |
---|---|
bin | 10101000001110111111… |
… | …000100010001000000000 |
3 | 12010011002220211112112211 |
4 | 111001313320202020000 |
5 | 142134101300220000 |
6 | 3023513515431504 |
7 | 206256300021340 |
oct | 25016770421000 |
9 | 5104086745484 |
10 | 1445120320000 |
11 | 507965823555 |
12 | 1b40a7a55594 |
13 | a6374724786 |
14 | 4dd30c38d20 |
15 | 278ce4187ba |
hex | 15077e22200 |
1445120320000 has 400 divisors, whose sum is σ = 4185543447360. Its totient is φ = 488024064000.
The previous prime is 1445120319967. The next prime is 1445120320037. The reversal of 1445120320000 is 230215441.
It is a tau number, because it is divible by the number of its divisors (400).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 150075186 + ... + 150084814.
Almost surely, 21445120320000 is an apocalyptic number.
1445120320000 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 1445120320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2092771723680).
1445120320000 is an abundant number, since it is smaller than the sum of its proper divisors (2740423127360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1445120320000 is an frugal number, since it uses more digits than its factorization.
1445120320000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9741 (or 9710 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 1445120320000 its reverse (230215441), we get a palindrome (1445350535441).
The spelling of 1445120320000 in words is "one trillion, four hundred forty-five billion, one hundred twenty million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •