Base | Representation |
---|---|
bin | 101111110101010011… |
… | …101000110111101011 |
3 | 11220120101021210220112 |
4 | 233311103220313223 |
5 | 1320141203100230 |
6 | 35332231244535 |
7 | 3465516356555 |
oct | 576523506753 |
9 | 156511253815 |
10 | 51360206315 |
11 | 1a866552200 |
12 | 9b5451974b |
13 | 4ac67c7832 |
14 | 26b32444d5 |
15 | 1508ec8d95 |
hex | bf54e8deb |
51360206315 has 48 divisors (see below), whose sum is σ = 68252556960. Its totient is φ = 37074048000.
The previous prime is 51360206267. The next prime is 51360206321.
51360206315 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 51360206315 - 210 = 51360205291 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 65260352 + ... + 65261138.
It is an arithmetic number, because the mean of its divisors is an integer number (1421928270).
Almost surely, 251360206315 is an apocalyptic number.
51360206315 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
51360206315 is a deficient number, since it is larger than the sum of its proper divisors (16892350645).
51360206315 is a wasteful number, since it uses less digits than its factorization.
51360206315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1484 (or 1473 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 32.
The spelling of 51360206315 in words is "fifty-one billion, three hundred sixty million, two hundred six thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.259 sec. • engine limits •