Base | Representation |
---|---|
bin | 10100111111100100111… |
… | …111111010100110010100 |
3 | 12002220202011210100012101 |
4 | 110333210333322212110 |
5 | 142114024414121000 |
6 | 3022425204531444 |
7 | 206141234465134 |
oct | 24774477724624 |
9 | 5086664710171 |
10 | 1442656004500 |
11 | 506910782877 |
12 | 1b371a6b0b84 |
13 | a607100a819 |
14 | 4db79836ac4 |
15 | 277d7ddae6a |
hex | 14fe4ffa994 |
1442656004500 has 48 divisors (see below), whose sum is σ = 3163834674000. Its totient is φ = 574667904000.
The previous prime is 1442656004437. The next prime is 1442656004519. The reversal of 1442656004500 is 54006562441.
It can be written as a sum of positive squares in 8 ways, for example, as 106398611344 + 1336257393156 = 326188^2 + 1155966^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1442656004500.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5865625 + ... + 6106624.
It is an arithmetic number, because the mean of its divisors is an integer number (65913222375).
Almost surely, 21442656004500 is an apocalyptic number.
1442656004500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1442656004500 is an abundant number, since it is smaller than the sum of its proper divisors (1721178669500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1442656004500 is a wasteful number, since it uses less digits than its factorization.
1442656004500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11972509 (or 11972497 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 37.
The spelling of 1442656004500 in words is "one trillion, four hundred forty-two billion, six hundred fifty-six million, four thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •