Base | Representation |
---|---|
bin | 11101010001011000… |
… | …10100000011011010 |
3 | 1111120012201022122110 |
4 | 32220230110003122 |
5 | 224141030400100 |
6 | 11115220533150 |
7 | 1064302031550 |
oct | 165054240332 |
9 | 44505638573 |
10 | 15715090650 |
11 | 6734839226 |
12 | 3066b511b6 |
13 | 1635a4010c |
14 | a911a9bd0 |
15 | 61e9b8250 |
hex | 3a8b140da |
15715090650 has 96 divisors (see below), whose sum is σ = 44736243840. Its totient is φ = 3576280320.
The previous prime is 15715090639. The next prime is 15715090693. The reversal of 15715090650 is 5609051751.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 15715090599 and 15715090608.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 207772 + ... + 273128.
It is an arithmetic number, because the mean of its divisors is an integer number (466002540).
Almost surely, 215715090650 is an apocalyptic number.
15715090650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 15715090650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22368121920).
15715090650 is an abundant number, since it is smaller than the sum of its proper divisors (29021153190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15715090650 is a wasteful number, since it uses less digits than its factorization.
15715090650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65608 (or 65603 counting only the distinct ones).
The product of its (nonzero) digits is 47250, while the sum is 39.
The spelling of 15715090650 in words is "fifteen billion, seven hundred fifteen million, ninety thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •