Base | Representation |
---|---|
bin | 100001100101110011… |
… | …0100011000010110110 |
3 | 20220012020101210110000 |
4 | 1003023212203002312 |
5 | 2140213122402343 |
6 | 53045531012130 |
7 | 5132403262044 |
oct | 1031346430266 |
9 | 226166353400 |
10 | 72135356598 |
11 | 2865758a098 |
12 | 11b91b9a046 |
13 | 6a57964676 |
14 | 36c4467394 |
15 | 1d22d0ded3 |
hex | 10cb9a30b6 |
72135356598 has 80 divisors (see below), whose sum is σ = 164091321504. Its totient is φ = 23680702080.
The previous prime is 72135356593. The next prime is 72135356627. The reversal of 72135356598 is 89565353127.
72135356598 is a `hidden beast` number, since 7 + 2 + 13 + 5 + 35 + 6 + 598 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72135356593) by changing a digit.
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 39 ways as a sum of consecutive naturals, for example, 12614836 + ... + 12620552.
Almost surely, 272135356598 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 72135356598, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82045660752).
72135356598 is an abundant number, since it is smaller than the sum of its proper divisors (91955964906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72135356598 is a wasteful number, since it uses less digits than its factorization.
72135356598 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6899 (or 6890 counting only the distinct ones).
The product of its digits is 6804000, while the sum is 54.
The spelling of 72135356598 in words is "seventy-two billion, one hundred thirty-five million, three hundred fifty-six thousand, five hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •