Base | Representation |
---|---|
bin | 10011000100110000… |
… | …01001111110110110 |
3 | 222102200011221201010 |
4 | 21202120021332312 |
5 | 131433022342402 |
6 | 4412052013050 |
7 | 511524153003 |
oct | 114230117666 |
9 | 28380157633 |
10 | 10240434102 |
11 | 4385504788 |
12 | 1b99601186 |
13 | c72760a82 |
14 | 6d206c8aa |
15 | 3ee052a6c |
hex | 262609fb6 |
10240434102 has 8 divisors (see below), whose sum is σ = 20480868216. Its totient is φ = 3413478032.
The previous prime is 10240434101. The next prime is 10240434181. The reversal of 10240434102 is 20143404201.
10240434102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
10240434102 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10240434101) 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 3 ways as a sum of consecutive naturals, for example, 853369503 + ... + 853369514.
It is an arithmetic number, because the mean of its divisors is an integer number (2560108527).
Almost surely, 210240434102 is an apocalyptic number.
10240434102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10240434102 is a wasteful number, since it uses less digits than its factorization.
10240434102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1706739022.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 10240434102 its reverse (20143404201), we get a palindrome (30383838303).
The spelling of 10240434102 in words is "ten billion, two hundred forty million, four hundred thirty-four thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •