Base | Representation |
---|---|
bin | 111011110010101… |
… | …011100100101101 |
3 | 2120220120212022222 |
4 | 323302223210231 |
5 | 4023301011141 |
6 | 243312445125 |
7 | 33600363362 |
oct | 7362534455 |
9 | 2526525288 |
10 | 1003141421 |
11 | 475279aa7 |
12 | 23bb497a5 |
13 | 12ca9a009 |
14 | 97328469 |
15 | 5d10214b |
hex | 3bcab92d |
1003141421 has 2 divisors, whose sum is σ = 1003141422. Its totient is φ = 1003141420.
The previous prime is 1003141397. The next prime is 1003141483. The reversal of 1003141421 is 1241413001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1002418921 + 722500 = 31661^2 + 850^2 .
It is an emirp because it is prime and its reverse (1241413001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1003141421 - 26 = 1003141357 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1003141421.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1003161421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501570710 + 501570711.
It is an arithmetic number, because the mean of its divisors is an integer number (501570711).
Almost surely, 21003141421 is an apocalyptic number.
It is an amenable number.
1003141421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1003141421 is an equidigital number, since it uses as much as digits as its factorization.
1003141421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1003141421 is about 31672.4078813089. The cubic root of 1003141421 is about 1001.0460457401.
Adding to 1003141421 its reverse (1241413001), we get a palindrome (2244554422).
The spelling of 1003141421 in words is "one billion, three million, one hundred forty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •