Base | Representation |
---|---|
bin | 10011101001010011001… |
… | …010100011100100011001 |
3 | 11210001121212102001120212 |
4 | 103221103022203210121 |
5 | 134104312320211001 |
6 | 2512104402500505 |
7 | 166351426136333 |
oct | 23512312434431 |
9 | 4701555361525 |
10 | 1350015007001 |
11 | 4805a1305221 |
12 | 199785364735 |
13 | 9a3c8cbca3b |
14 | 494abca4453 |
15 | 251b4c817bb |
hex | 13a532a3919 |
1350015007001 has 2 divisors, whose sum is σ = 1350015007002. Its totient is φ = 1350015007000.
The previous prime is 1350015006953. The next prime is 1350015007027. The reversal of 1350015007001 is 1007005100531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1123271424025 + 226743582976 = 1059845^2 + 476176^2 .
It is a cyclic number.
It is not a de Polignac number, because 1350015007001 - 218 = 1350014744857 is a prime.
It is not a weakly prime, because it can be changed into another prime (1350015007031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675007503500 + 675007503501.
It is an arithmetic number, because the mean of its divisors is an integer number (675007503501).
Almost surely, 21350015007001 is an apocalyptic number.
It is an amenable number.
1350015007001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350015007001 is an equidigital number, since it uses as much as digits as its factorization.
1350015007001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 525, while the sum is 23.
The spelling of 1350015007001 in words is "one trillion, three hundred fifty billion, fifteen million, seven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •