Base | Representation |
---|---|
bin | 10010111010101111… |
… | …11000100001000101 |
3 | 222012211012110111202 |
4 | 21131113320201011 |
5 | 131300024221420 |
6 | 4355452312245 |
7 | 506454424421 |
oct | 113527704105 |
9 | 28184173452 |
10 | 10156476485 |
11 | 4342080121 |
12 | 1b75472685 |
13 | c5b2461cc |
14 | 6c4c55b81 |
15 | 3e69bb575 |
hex | 25d5f8845 |
10156476485 has 8 divisors (see below), whose sum is σ = 12188374296. Its totient is φ = 8124779520.
The previous prime is 10156476437. The next prime is 10156476497. The reversal of 10156476485 is 58467465101.
10156476485 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 67881121 + 10088595364 = 8239^2 + 100442^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10156476485 - 214 = 10156460101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 104237 + ... + 176573.
It is an arithmetic number, because the mean of its divisors is an integer number (1523546787).
Almost surely, 210156476485 is an apocalyptic number.
It is an amenable number.
10156476485 is a deficient number, since it is larger than the sum of its proper divisors (2031897811).
10156476485 is an equidigital number, since it uses as much as digits as its factorization.
10156476485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100423.
The product of its (nonzero) digits is 806400, while the sum is 47.
The spelling of 10156476485 in words is "ten billion, one hundred fifty-six million, four hundred seventy-six thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •