Base | Representation |
---|---|
bin | 10010010001010010110… |
… | …110101000100110110000 |
3 | 11110000201101022221202022 |
4 | 102101102312220212300 |
5 | 131032301222113430 |
6 | 2400440025411012 |
7 | 156464653126232 |
oct | 22212266504660 |
9 | 4400641287668 |
10 | 1255520504240 |
11 | 444510658742 |
12 | 1833b3339a68 |
13 | 91519c9a192 |
14 | 44aa60cc252 |
15 | 229d40504e5 |
hex | 12452da89b0 |
1255520504240 has 40 divisors (see below), whose sum is σ = 2919132971568. Its totient is φ = 502199978240.
The previous prime is 1255520504149. The next prime is 1255520504263. The reversal of 1255520504240 is 424050255521.
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 1255520504240.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7915310 + ... + 8072370.
Almost surely, 21255520504240 is an apocalyptic number.
1255520504240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1255520504240 is an abundant number, since it is smaller than the sum of its proper divisors (1663612467328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1255520504240 is a wasteful number, since it uses less digits than its factorization.
1255520504240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256997 (or 256991 counting only the distinct ones).
The product of its (nonzero) digits is 80000, while the sum is 35.
Adding to 1255520504240 its reverse (424050255521), we get a palindrome (1679570759761).
The spelling of 1255520504240 in words is "one trillion, two hundred fifty-five billion, five hundred twenty million, five hundred four thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •