Base | Representation |
---|---|
bin | 11101000010010101101… |
… | …110101110110000000000 |
3 | 21001202102020122001110010 |
4 | 131002111232232300000 |
5 | 230143012440140030 |
6 | 4124355151304520 |
7 | 264106204431663 |
oct | 35022556566000 |
9 | 7052366561403 |
10 | 1995376880640 |
11 | 6aa264258890 |
12 | 28287381b140 |
13 | 116217810ba0 |
14 | 6c8108956da |
15 | 36d871be6b0 |
hex | 1d095baec00 |
1995376880640 has 704 divisors, whose sum is σ = 7532477890560. Its totient is φ = 444455976960.
The previous prime is 1995376880593. The next prime is 1995376880663. The reversal of 1995376880640 is 460886735991.
It is a tau number, because it is divible by the number of its divisors (704).
It is a Harshad number since it is a multiple of its sum of digits (66).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 502991937 + ... + 502995903.
Almost surely, 21995376880640 is an apocalyptic number.
1995376880640 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 1995376880640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3766238945280).
1995376880640 is an abundant number, since it is smaller than the sum of its proper divisors (5537101009920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1995376880640 is a wasteful number, since it uses less digits than its factorization.
1995376880640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4248 (or 4230 counting only the distinct ones).
The product of its (nonzero) digits is 78382080, while the sum is 66.
The spelling of 1995376880640 in words is "one trillion, nine hundred ninety-five billion, three hundred seventy-six million, eight hundred eighty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •