Base | Representation |
---|---|
bin | 10110100100010010111… |
… | …101110011011111110000 |
3 | 12111020220000101220112020 |
4 | 112210102331303133300 |
5 | 200402020123313311 |
6 | 3144232303431440 |
7 | 220020206165031 |
oct | 26442275633760 |
9 | 5436800356466 |
10 | 1550801385456 |
11 | 548766a53174 |
12 | 2106802b5580 |
13 | b33172029bb |
14 | 550b85a6a88 |
15 | 2a51728bc06 |
hex | 16912f737f0 |
1550801385456 has 40 divisors (see below), whose sum is σ = 4015798389120. Its totient is φ = 515700056256.
The previous prime is 1550801385421. The next prime is 1550801385559. The reversal of 1550801385456 is 6545831080551.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1550801385399 and 1550801385408.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38534020 + ... + 38574243.
It is an arithmetic number, because the mean of its divisors is an integer number (100394959728).
Almost surely, 21550801385456 is an apocalyptic number.
1550801385456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1550801385456 is an abundant number, since it is smaller than the sum of its proper divisors (2464997003664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1550801385456 is a wasteful number, since it uses less digits than its factorization.
1550801385456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77108693 (or 77108687 counting only the distinct ones).
The product of its (nonzero) digits is 2880000, while the sum is 51.
The spelling of 1550801385456 in words is "one trillion, five hundred fifty billion, eight hundred one million, three hundred eighty-five thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •