Base | Representation |
---|---|
bin | 10010111011010101… |
… | …11011101111111100 |
3 | 222020011121011221210 |
4 | 21131222323233330 |
5 | 131302314023320 |
6 | 4400151324420 |
7 | 506545034211 |
oct | 113552735774 |
9 | 28204534853 |
10 | 10161470460 |
11 | 4344981179 |
12 | 1b77080710 |
13 | c5c2a431b |
14 | 6c5795b08 |
15 | 3e71560e0 |
hex | 25dabbbfc |
10161470460 has 48 divisors (see below), whose sum is σ = 28496474496. Its totient is φ = 2705500992.
The previous prime is 10161470447. The next prime is 10161470489. The reversal of 10161470460 is 6407416101.
It is a super-2 number, since 2×101614704602 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 93114 + ... + 170273.
It is an arithmetic number, because the mean of its divisors is an integer number (593676552).
Almost surely, 210161470460 is an apocalyptic number.
10161470460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10161470460 is an abundant number, since it is smaller than the sum of its proper divisors (18335004036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10161470460 is a wasteful number, since it uses less digits than its factorization.
10161470460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264042 (or 264040 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 30.
Adding to 10161470460 its reverse (6407416101), we get a palindrome (16568886561).
The spelling of 10161470460 in words is "ten billion, one hundred sixty-one million, four hundred seventy thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •