Base | Representation |
---|---|
bin | 111100011100111… |
… | …010100110001001 |
3 | 2121200102100200111 |
4 | 330130322212021 |
5 | 4034114304001 |
6 | 244350034321 |
7 | 34063445134 |
oct | 7434724611 |
9 | 2550370614 |
10 | 1014213001 |
11 | 48055126a |
12 | 2437a89a1 |
13 | 132175549 |
14 | 989ab21b |
15 | 5e08c851 |
hex | 3c73a989 |
1014213001 has 2 divisors, whose sum is σ = 1014213002. Its totient is φ = 1014213000.
The previous prime is 1014212999. The next prime is 1014213029. The reversal of 1014213001 is 1003124101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 708837376 + 305375625 = 26624^2 + 17475^2 .
It is a cyclic number.
It is not a de Polignac number, because 1014213001 - 21 = 1014212999 is a prime.
It is a super-2 number, since 2×10142130012 = 2057256022794852002, which contains 22 as substring.
Together with 1014212999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1014213071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 507106500 + 507106501.
It is an arithmetic number, because the mean of its divisors is an integer number (507106501).
Almost surely, 21014213001 is an apocalyptic number.
It is an amenable number.
1014213001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014213001 is an equidigital number, since it uses as much as digits as its factorization.
1014213001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1014213001 is about 31846.7109918748. The cubic root of 1014213001 is about 1004.7153970815.
Adding to 1014213001 its reverse (1003124101), we get a palindrome (2017337102).
Subtracting from 1014213001 its reverse (1003124101), we obtain a square (11088900 = 33302).
The spelling of 1014213001 in words is "one billion, fourteen million, two hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •