Base | Representation |
---|---|
bin | 10011110100100000010… |
… | …001111101111110001101 |
3 | 11211012200100020200221011 |
4 | 103310200101331332031 |
5 | 134303432312322104 |
6 | 2521414305205221 |
7 | 200255526536554 |
oct | 23644021757615 |
9 | 4735610220834 |
10 | 1362046214029 |
11 | 485705641126 |
12 | 19bb82630811 |
13 | 9b59575ca57 |
14 | 49ccdac6d9b |
15 | 2566b118904 |
hex | 13d2047df8d |
1362046214029 has 2 divisors, whose sum is σ = 1362046214030. Its totient is φ = 1362046214028.
The previous prime is 1362046214021. The next prime is 1362046214069. The reversal of 1362046214029 is 9204126402631.
It is a happy number.
It is an a-pointer prime, because the next prime (1362046214069) can be obtained adding 1362046214029 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1254657613225 + 107388600804 = 1120115^2 + 327702^2 .
It is a cyclic number.
It is not a de Polignac number, because 1362046214029 - 23 = 1362046214021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1362046213982 and 1362046214000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1362046214021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 681023107014 + 681023107015.
It is an arithmetic number, because the mean of its divisors is an integer number (681023107015).
Almost surely, 21362046214029 is an apocalyptic number.
It is an amenable number.
1362046214029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1362046214029 is an equidigital number, since it uses as much as digits as its factorization.
1362046214029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 124416, while the sum is 40.
The spelling of 1362046214029 in words is "one trillion, three hundred sixty-two billion, forty-six million, two hundred fourteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •