Base | Representation |
---|---|
bin | 111100001110000… |
… | …100100000000101 |
3 | 2121102002122102121 |
4 | 330032010200011 |
5 | 4032120241123 |
6 | 244130405541 |
7 | 34015406323 |
oct | 7416044005 |
9 | 2542078377 |
10 | 1010321413 |
11 | 479333482 |
12 | 2424308b1 |
13 | 13141212a |
14 | 98276d13 |
15 | 5da6e75d |
hex | 3c384805 |
1010321413 has 2 divisors, whose sum is σ = 1010321414. Its totient is φ = 1010321412.
The previous prime is 1010321399. The next prime is 1010321461. The reversal of 1010321413 is 3141230101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 776904129 + 233417284 = 27873^2 + 15278^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010321413 - 25 = 1010321381 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010321113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505160706 + 505160707.
It is an arithmetic number, because the mean of its divisors is an integer number (505160707).
Almost surely, 21010321413 is an apocalyptic number.
It is an amenable number.
1010321413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010321413 is an equidigital number, since it uses as much as digits as its factorization.
1010321413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1010321413 is about 31785.5535267203. The cubic root of 1010321413 is about 1003.4287015696.
Adding to 1010321413 its reverse (3141230101), we get a palindrome (4151551514).
The spelling of 1010321413 in words is "one billion, ten million, three hundred twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •