Base | Representation |
---|---|
bin | 10011111101001111001… |
… | …110010111000101011101 |
3 | 11212002212212200222022211 |
4 | 103331033032113011131 |
5 | 134432133433411221 |
6 | 2530005014040421 |
7 | 201040105245355 |
oct | 23751716270535 |
9 | 4762785628284 |
10 | 1371423732061 |
11 | 489687a42229 |
12 | 1a195b049111 |
13 | 9c42b4ac5a6 |
14 | 4a53d2cdb65 |
15 | 25a195176e1 |
hex | 13f4f39715d |
1371423732061 has 2 divisors, whose sum is σ = 1371423732062. Its totient is φ = 1371423732060.
The previous prime is 1371423732053. The next prime is 1371423732067. The reversal of 1371423732061 is 1602373241731.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1371077064900 + 346667161 = 1170930^2 + 18619^2 .
It is an emirp because it is prime and its reverse (1602373241731) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1371423732061 - 23 = 1371423732053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1371423732067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 685711866030 + 685711866031.
It is an arithmetic number, because the mean of its divisors is an integer number (685711866031).
Almost surely, 21371423732061 is an apocalyptic number.
It is an amenable number.
1371423732061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1371423732061 is an equidigital number, since it uses as much as digits as its factorization.
1371423732061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 127008, while the sum is 40.
Adding to 1371423732061 its reverse (1602373241731), we get a palindrome (2973796973792).
The spelling of 1371423732061 in words is "one trillion, three hundred seventy-one billion, four hundred twenty-three million, seven hundred thirty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •