Base | Representation |
---|---|
bin | 10000011111100110100001… |
… | …100001011101101110111100 |
3 | 100111211210111002001102021221 |
4 | 100133212201201131232330 |
5 | 34002000231104111320 |
6 | 414140334441203124 |
7 | 21164605022122066 |
oct | 2037464141355674 |
9 | 314753432042257 |
10 | 72540412566460 |
11 | 21128241850763 |
12 | 81769994904a4 |
13 | 31626baa8c757 |
14 | 13cad9081c736 |
15 | 85be214353aa |
hex | 41f9a185dbbc |
72540412566460 has 12 divisors (see below), whose sum is σ = 152334866389608. Its totient is φ = 29016165026576.
The previous prime is 72540412566437. The next prime is 72540412566467. The reversal of 72540412566460 is 6466521404527.
It is a super-2 number, since 2×725404125664602 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 72540412566398 and 72540412566407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72540412566467) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1813510314142 + ... + 1813510314181.
It is an arithmetic number, because the mean of its divisors is an integer number (12694572199134).
Almost surely, 272540412566460 is an apocalyptic number.
It is an amenable number.
72540412566460 is an abundant number, since it is smaller than the sum of its proper divisors (79794453823148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72540412566460 is a wasteful number, since it uses less digits than its factorization.
72540412566460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3627020628332 (or 3627020628330 counting only the distinct ones).
The product of its (nonzero) digits is 9676800, while the sum is 52.
The spelling of 72540412566460 in words is "seventy-two trillion, five hundred forty billion, four hundred twelve million, five hundred sixty-six thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •