Base | Representation |
---|---|
bin | 100111001100001… |
… | …1100011110001001 |
3 | 10101122110111021221 |
4 | 1032120130132021 |
5 | 10143121442141 |
6 | 334253402041 |
7 | 44405402251 |
oct | 11630343611 |
9 | 3348414257 |
10 | 1315030921 |
11 | 615334216 |
12 | 308499321 |
13 | 17c59b709 |
14 | c6914961 |
15 | 7a6adbd1 |
hex | 4e61c789 |
1315030921 has 2 divisors, whose sum is σ = 1315030922. Its totient is φ = 1315030920.
The previous prime is 1315030889. The next prime is 1315030961. The reversal of 1315030921 is 1290305131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1234749321 + 80281600 = 35139^2 + 8960^2 .
It is an emirp because it is prime and its reverse (1290305131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1315030921 - 25 = 1315030889 is a prime.
It is a super-2 number, since 2×13150309212 = 3458612646372216482, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1315030961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 657515460 + 657515461.
It is an arithmetic number, because the mean of its divisors is an integer number (657515461).
Almost surely, 21315030921 is an apocalyptic number.
It is an amenable number.
1315030921 is a deficient number, since it is larger than the sum of its proper divisors (1).
1315030921 is an equidigital number, since it uses as much as digits as its factorization.
1315030921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 25.
The square root of 1315030921 is about 36263.3550709252. The cubic root of 1315030921 is about 1095.5830929048.
The spelling of 1315030921 in words is "one billion, three hundred fifteen million, thirty thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •