Base | Representation |
---|---|
bin | 10101000001110010110… |
… | …001011001100011001110 |
3 | 12010010212221110200010220 |
4 | 111001302301121203032 |
5 | 142133412322020130 |
6 | 3023501213412210 |
7 | 206254206062256 |
oct | 25016261314316 |
9 | 5103787420126 |
10 | 1445034563790 |
11 | 507921380654 |
12 | 1b408319a066 |
13 | a635ca2a35c |
14 | 4dd236b4966 |
15 | 278c6b29410 |
hex | 15072c598ce |
1445034563790 has 128 divisors (see below), whose sum is σ = 3673015621632. Its totient is φ = 363082621440.
The previous prime is 1445034563789. The next prime is 1445034563821. The reversal of 1445034563790 is 973654305441.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 59412712 + ... + 59437028.
It is an arithmetic number, because the mean of its divisors is an integer number (28695434544).
Almost surely, 21445034563790 is an apocalyptic number.
1445034563790 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1445034563790, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1836507810816).
1445034563790 is an abundant number, since it is smaller than the sum of its proper divisors (2227981057842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1445034563790 is a wasteful number, since it uses less digits than its factorization.
1445034563790 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25634.
The product of its (nonzero) digits is 5443200, while the sum is 51.
The spelling of 1445034563790 in words is "one trillion, four hundred forty-five billion, thirty-four million, five hundred sixty-three thousand, seven hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •