Base | Representation |
---|---|
bin | 10100110011111101011… |
… | …10001010000001111100 |
3 | 2112100202220010022100021 |
4 | 22121332232022001330 |
5 | 43204001143200220 |
6 | 1304301425141524 |
7 | 102443416545034 |
oct | 12317656120174 |
9 | 2470686108307 |
10 | 715090600060 |
11 | 2562a50018a1 |
12 | b670a48a8a4 |
13 | 525819b80a5 |
14 | 268795908c4 |
15 | 13903d164aa |
hex | a67eb8a07c |
715090600060 has 12 divisors (see below), whose sum is σ = 1501690260168. Its totient is φ = 286036240016.
The previous prime is 715090599983. The next prime is 715090600067. The reversal of 715090600060 is 60006090517.
It is a super-3 number, since 3×7150906000603 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 715090599989 and 715090600025.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (715090600067) 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, 17877264982 + ... + 17877265021.
It is an arithmetic number, because the mean of its divisors is an integer number (125140855014).
Almost surely, 2715090600060 is an apocalyptic number.
It is an amenable number.
715090600060 is an abundant number, since it is smaller than the sum of its proper divisors (786599660108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
715090600060 is a wasteful number, since it uses less digits than its factorization.
715090600060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35754530012 (or 35754530010 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 34.
Adding to 715090600060 its reverse (60006090517), we get a palindrome (775096690577).
The spelling of 715090600060 in words is "seven hundred fifteen billion, ninety million, six hundred thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •