Base | Representation |
---|---|
bin | 10010110100011110… |
… | …00000110011001111 |
3 | 222002011010012122222 |
4 | 21122033000303033 |
5 | 131143034210341 |
6 | 4350331525555 |
7 | 505245022424 |
oct | 113217006317 |
9 | 28064105588 |
10 | 10103819471 |
11 | 4315385129 |
12 | 1b5b8b98bb |
13 | c5036a605 |
14 | 6bbc69d4b |
15 | 3e206944b |
hex | 25a3c0ccf |
10103819471 has 8 divisors (see below), whose sum is σ = 10292997120. Its totient is φ = 9916174008.
The previous prime is 10103819447. The next prime is 10103819489. The reversal of 10103819471 is 17491830101.
10103819471 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 a cyclic number.
It is not a de Polignac number, because 10103819471 - 222 = 10099625167 is a prime.
It is a super-3 number, since 3×101038194713 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10103819441) 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, 369731 + ... + 396116.
It is an arithmetic number, because the mean of its divisors is an integer number (1286624640).
Almost surely, 210103819471 is an apocalyptic number.
10103819471 is a deficient number, since it is larger than the sum of its proper divisors (189177649).
10103819471 is an equidigital number, since it uses as much as digits as its factorization.
10103819471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 766093.
The product of its (nonzero) digits is 6048, while the sum is 35.
The spelling of 10103819471 in words is "ten billion, one hundred three million, eight hundred nineteen thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •