Base | Representation |
---|---|
bin | 11101111101010110100… |
… | …11110001010011111001 |
3 | 10122101222122122112222102 |
4 | 32332223103301103321 |
5 | 113331123021123033 |
6 | 2104515302433145 |
7 | 134240531300654 |
oct | 16765323612371 |
9 | 3571878575872 |
10 | 1029371270393 |
11 | 367610279084 |
12 | 1475ba4327b5 |
13 | 760b931638b |
14 | 37b7118a89b |
15 | 1bb9a099de8 |
hex | efab4f14f9 |
1029371270393 has 2 divisors, whose sum is σ = 1029371270394. Its totient is φ = 1029371270392.
The previous prime is 1029371270359. The next prime is 1029371270437. The reversal of 1029371270393 is 3930721739201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 804460104889 + 224911165504 = 896917^2 + 474248^2 .
It is a cyclic number.
It is not a de Polignac number, because 1029371270393 - 210 = 1029371269369 is a prime.
It is a super-3 number, since 3×10293712703933 (a number of 37 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1029371270303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 514685635196 + 514685635197.
It is an arithmetic number, because the mean of its divisors is an integer number (514685635197).
Almost surely, 21029371270393 is an apocalyptic number.
It is an amenable number.
1029371270393 is a deficient number, since it is larger than the sum of its proper divisors (1).
1029371270393 is an equidigital number, since it uses as much as digits as its factorization.
1029371270393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 428652, while the sum is 47.
The spelling of 1029371270393 in words is "one trillion, twenty-nine billion, three hundred seventy-one million, two hundred seventy thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •