Base | Representation |
---|---|
bin | 1111110111001011011… |
… | …11111000000011101000 |
3 | 1221002210102001121111020 |
4 | 13323211233320003220 |
5 | 32412200211142021 |
6 | 1054213502532440 |
7 | 54243054031254 |
oct | 7734557700350 |
9 | 1832712047436 |
10 | 545020412136 |
11 | 1a01618a5482 |
12 | 89766297120 |
13 | 3c51a357ab5 |
14 | 1c544487264 |
15 | e29d2547c6 |
hex | 7ee5bf80e8 |
545020412136 has 128 divisors (see below), whose sum is σ = 1403685504000. Its totient is φ = 176280519168.
The previous prime is 545020412129. The next prime is 545020412141. The reversal of 545020412136 is 631214020545.
It is a junction number, because it is equal to n+sod(n) for n = 545020412097 and 545020412106.
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 31 ways as a sum of consecutive naturals, for example, 45644455 + ... + 45656393.
It is an arithmetic number, because the mean of its divisors is an integer number (10966293000).
Almost surely, 2545020412136 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 545020412136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (701842752000).
545020412136 is an abundant number, since it is smaller than the sum of its proper divisors (858665091864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
545020412136 is a wasteful number, since it uses less digits than its factorization.
545020412136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12423 (or 12419 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 33.
The spelling of 545020412136 in words is "five hundred forty-five billion, twenty million, four hundred twelve thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •