Base | Representation |
---|---|
bin | 1011001011100101… |
… | …1100001011110111 |
3 | 21202011200000122212 |
4 | 2302321130023313 |
5 | 22121324331403 |
6 | 1213454244035 |
7 | 134243332310 |
oct | 26271341367 |
9 | 7664600585 |
10 | 3001402103 |
11 | 1300238907 |
12 | 6b91b661b |
13 | 38aa8579b |
14 | 20688d607 |
15 | 12876e4d8 |
hex | b2e5c2f7 |
3001402103 has 4 divisors (see below), whose sum is σ = 3430173840. Its totient is φ = 2572630368.
The previous prime is 3001402069. The next prime is 3001402111. The reversal of 3001402103 is 3012041003.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3012041003 = 31 ⋅97162613.
It is not a de Polignac number, because 3001402103 - 28 = 3001401847 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3001402903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 214385858 + ... + 214385871.
It is an arithmetic number, because the mean of its divisors is an integer number (857543460).
Almost surely, 23001402103 is an apocalyptic number.
3001402103 is a deficient number, since it is larger than the sum of its proper divisors (428771737).
3001402103 is an equidigital number, since it uses as much as digits as its factorization.
3001402103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428771736.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 3001402103 is about 54785.0536460447. The cubic root of 3001402103 is about 1442.4742222515.
Adding to 3001402103 its reverse (3012041003), we get a palindrome (6013443106).
The spelling of 3001402103 in words is "three billion, one million, four hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •