Base | Representation |
---|---|
bin | 10000000010110010110… |
… | …10110010100111111101 |
3 | 1221200212222102202121010 |
4 | 20001121122302213331 |
5 | 33012433014243323 |
6 | 1101124333225433 |
7 | 54553431523500 |
oct | 10013132624775 |
9 | 1850788382533 |
10 | 551256009213 |
11 | 1a2871711898 |
12 | 8aa06632279 |
13 | 3cca2192600 |
14 | 1c9766a3137 |
15 | e5158c8c93 |
hex | 80596b29fd |
551256009213 has 144 divisors (see below), whose sum is σ = 960483142080. Its totient is φ = 280080073728.
The previous prime is 551256009203. The next prime is 551256009223. The reversal of 551256009213 is 312900652155.
551256009213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (551256009203) and next prime (551256009223).
It is not a de Polignac number, because 551256009213 - 210 = 551256008189 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (551256009203) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 77978643 + ... + 77985711.
It is an arithmetic number, because the mean of its divisors is an integer number (6670021820).
Almost surely, 2551256009213 is an apocalyptic number.
It is an amenable number.
551256009213 is a deficient number, since it is larger than the sum of its proper divisors (409227132867).
551256009213 is a wasteful number, since it uses less digits than its factorization.
551256009213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7228 (or 7208 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 39.
The spelling of 551256009213 in words is "five hundred fifty-one billion, two hundred fifty-six million, nine thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •