Base | Representation |
---|---|
bin | 10011000100111101… |
… | …00001001011110011 |
3 | 222102210022200122020 |
4 | 21202132201023303 |
5 | 131433434231003 |
6 | 4412151442523 |
7 | 511544300460 |
oct | 114236411363 |
9 | 28383280566 |
10 | 10242102003 |
11 | 4386443911 |
12 | 1b9a086443 |
13 | c72bc5cb3 |
14 | 6d2384667 |
15 | 3ee281d53 |
hex | 2627a12f3 |
10242102003 has 8 divisors (see below), whose sum is σ = 15607012608. Its totient is φ = 5852629704.
The previous prime is 10242101983. The next prime is 10242102007. The reversal of 10242102003 is 30020124201.
10242102003 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 10242102003 - 26 = 10242101939 is a prime.
It is a super-2 number, since 2×102421020032 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10242102007) 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, 243859551 + ... + 243859592.
It is an arithmetic number, because the mean of its divisors is an integer number (1950876576).
Almost surely, 210242102003 is an apocalyptic number.
10242102003 is a deficient number, since it is larger than the sum of its proper divisors (5364910605).
10242102003 is an equidigital number, since it uses as much as digits as its factorization.
10242102003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 487719153.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 10242102003 its reverse (30020124201), we get a palindrome (40262226204).
The spelling of 10242102003 in words is "ten billion, two hundred forty-two million, one hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •