Base | Representation |
---|---|
bin | 10010111010000111… |
… | …01001110010010110 |
3 | 222012110020000212101 |
4 | 21131003221302112 |
5 | 131242200021040 |
6 | 4355142512314 |
7 | 506361356230 |
oct | 113503516226 |
9 | 28173200771 |
10 | 10151173270 |
11 | 433a0887a7 |
12 | 1b7373569a |
13 | c5a10a404 |
14 | 6c4275250 |
15 | 3e62c009a |
hex | 25d0e9c96 |
10151173270 has 64 divisors (see below), whose sum is σ = 21523138560. Its totient is φ = 3374980992.
The previous prime is 10151173267. The next prime is 10151173321. The reversal of 10151173270 is 7237115101.
10151173270 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 31 ways as a sum of consecutive naturals, for example, 344457 + ... + 372763.
It is an arithmetic number, because the mean of its divisors is an integer number (336299040).
Almost surely, 210151173270 is an apocalyptic number.
10151173270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10151173270 is an abundant number, since it is smaller than the sum of its proper divisors (11371965290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10151173270 is a wasteful number, since it uses less digits than its factorization.
10151173270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28477.
The product of its (nonzero) digits is 1470, while the sum is 28.
Adding to 10151173270 its reverse (7237115101), we get a palindrome (17388288371).
The spelling of 10151173270 in words is "ten billion, one hundred fifty-one million, one hundred seventy-three thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.464 sec. • engine limits •