Base | Representation |
---|---|
bin | 100001111111001110… |
… | …0000111011111111111 |
3 | 20222101200021210102220 |
4 | 1003332130013133333 |
5 | 2143434443312401 |
6 | 53310315420423 |
7 | 5162500655646 |
oct | 1037634073777 |
9 | 228350253386 |
10 | 72988260351 |
11 | 28a54a74326 |
12 | 1218b754713 |
13 | 6b6257b546 |
14 | 376584435d |
15 | 1d72b36336 |
hex | 10fe7077ff |
72988260351 has 8 divisors (see below), whose sum is σ = 97318974720. Its totient is φ = 48658193112.
The previous prime is 72988260349. The next prime is 72988260379. The reversal of 72988260351 is 15306288927.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 72988260351 - 21 = 72988260349 is a prime.
It is a super-2 number, since 2×729882603512 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 72988260294 and 72988260303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72988260451) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 254170 + ... + 458888.
It is an arithmetic number, because the mean of its divisors is an integer number (12164871840).
Almost surely, 272988260351 is an apocalyptic number.
72988260351 is a deficient number, since it is larger than the sum of its proper divisors (24330714369).
72988260351 is a wasteful number, since it uses less digits than its factorization.
72988260351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323565.
The product of its (nonzero) digits is 1451520, while the sum is 51.
The spelling of 72988260351 in words is "seventy-two billion, nine hundred eighty-eight million, two hundred sixty thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •