Base | Representation |
---|---|
bin | 10010111010000111… |
… | …00111011000101100 |
3 | 222012110012112101011 |
4 | 21131003213120230 |
5 | 131242144212221 |
6 | 4355142355004 |
7 | 506361315451 |
oct | 113503473054 |
9 | 28173175334 |
10 | 10151163436 |
11 | 433a081377 |
12 | 1b7372ba64 |
13 | c5a105aab |
14 | 6c4271828 |
15 | 3e62bc1e1 |
hex | 25d0e762c |
10151163436 has 24 divisors (see below), whose sum is σ = 18565666560. Its totient is φ = 4847372112.
The previous prime is 10151163431. The next prime is 10151163439. The reversal of 10151163436 is 63436115101.
10151163436 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101511634362 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10151163398 and 10151163407.
It is not an unprimeable number, because it can be changed into a prime (10151163431) by changing a digit.
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, 25746 + ... + 144793.
It is an arithmetic number, because the mean of its divisors is an integer number (773569440).
Almost surely, 210151163436 is an apocalyptic number.
It is an amenable number.
10151163436 is a deficient number, since it is larger than the sum of its proper divisors (8414503124).
10151163436 is a wasteful number, since it uses less digits than its factorization.
10151163436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171213 (or 171211 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 31.
Adding to 10151163436 its reverse (63436115101), we get a palindrome (73587278537).
The spelling of 10151163436 in words is "ten billion, one hundred fifty-one million, one hundred sixty-three thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •