Base | Representation |
---|---|
bin | 10010101001001111… |
… | …10011000100011011 |
3 | 221211120221002021120 |
4 | 21110213303010123 |
5 | 130444432403111 |
6 | 4333125340323 |
7 | 503022436233 |
oct | 112447630433 |
9 | 27746832246 |
10 | 10009653531 |
11 | 4277208939 |
12 | 1b342676a3 |
13 | c369ba417 |
14 | 6ad556cc3 |
15 | 3d8b68406 |
hex | 2549f311b |
10009653531 has 8 divisors (see below), whose sum is σ = 13671722064. Its totient is φ = 6510343680.
The previous prime is 10009653517. The next prime is 10009653547. The reversal of 10009653531 is 13535690001.
10009653531 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.
It is not a de Polignac number, because 10009653531 - 210 = 10009652507 is a prime.
It is a super-2 number, since 2×100096535312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10009653492 and 10009653501.
It is not an unprimeable number, because it can be changed into a prime (10009603531) 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, 40689526 + ... + 40689771.
It is an arithmetic number, because the mean of its divisors is an integer number (1708965258).
Almost surely, 210009653531 is an apocalyptic number.
10009653531 is a deficient number, since it is larger than the sum of its proper divisors (3662068533).
10009653531 is an equidigital number, since it uses as much as digits as its factorization.
10009653531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81379341.
The product of its (nonzero) digits is 12150, while the sum is 33.
The spelling of 10009653531 in words is "ten billion, nine million, six hundred fifty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •