Base | Representation |
---|---|
bin | 10010101110001011… |
… | …11001111100001000 |
3 | 221221110220210201200 |
4 | 21113011321330020 |
5 | 131041040203144 |
6 | 4341205544200 |
7 | 504034641531 |
oct | 112705717410 |
9 | 27843823650 |
10 | 10051100424 |
11 | 4298647572 |
12 | 1b46115060 |
13 | c4246c701 |
14 | 6b4c65688 |
15 | 3dc603c69 |
hex | 257179f08 |
10051100424 has 48 divisors (see below), whose sum is σ = 27502385820. Its totient is φ = 3315824640.
The previous prime is 10051100413. The next prime is 10051100467. The reversal of 10051100424 is 42400115001.
10051100424 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 2 ways, for example, as 10043647524 + 7452900 = 100218^2 + 2730^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10051100397 and 10051100406.
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 11 ways as a sum of consecutive naturals, for example, 712597 + ... + 726564.
Almost surely, 210051100424 is an apocalyptic number.
It is an amenable number.
10051100424 is an abundant number, since it is smaller than the sum of its proper divisors (17451285396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10051100424 is a wasteful number, since it uses less digits than its factorization.
10051100424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1439270 (or 1439263 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
Adding to 10051100424 its reverse (42400115001), we get a palindrome (52451215425).
The spelling of 10051100424 in words is "ten billion, fifty-one million, one hundred thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •