Base | Representation |
---|---|
bin | 101001010101110… |
… | …0100001101100101 |
3 | 10120200011122010111 |
4 | 1102223210031211 |
5 | 10320102332404 |
6 | 345351253021 |
7 | 46242412411 |
oct | 12253441545 |
9 | 3520148114 |
10 | 1387152229 |
11 | 652014001 |
12 | 32867a171 |
13 | 191500948 |
14 | d2329d41 |
15 | 81ba8104 |
hex | 52ae4365 |
1387152229 has 2 divisors, whose sum is σ = 1387152230. Its totient is φ = 1387152228.
The previous prime is 1387152211. The next prime is 1387152251. The reversal of 1387152229 is 9222517831.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1374407329 + 12744900 = 37073^2 + 3570^2 .
It is a cyclic number.
It is not a de Polignac number, because 1387152229 - 225 = 1353597797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1387152191 and 1387152200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1387152269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 693576114 + 693576115.
It is an arithmetic number, because the mean of its divisors is an integer number (693576115).
Almost surely, 21387152229 is an apocalyptic number.
It is an amenable number.
1387152229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1387152229 is an equidigital number, since it uses as much as digits as its factorization.
1387152229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 60480, while the sum is 40.
The square root of 1387152229 is about 37244.4925995777. The cubic root of 1387152229 is about 1115.2563585703.
The spelling of 1387152229 in words is "one billion, three hundred eighty-seven million, one hundred fifty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •