Base | Representation |
---|---|
bin | 10100011010000000011… |
… | …100010100000000111101 |
3 | 11222001121200122120122102 |
4 | 110122000130110000331 |
5 | 140433414421303112 |
6 | 2552114140554445 |
7 | 203212440255401 |
oct | 24320034240075 |
9 | 4861550576572 |
10 | 1402314244157 |
11 | 4a0799918172 |
12 | 1a7940252a25 |
13 | a23121c8608 |
14 | 4bc2db05101 |
15 | 267263e6bc2 |
hex | 1468071403d |
1402314244157 has 2 divisors, whose sum is σ = 1402314244158. Its totient is φ = 1402314244156.
The previous prime is 1402314244151. The next prime is 1402314244193. The reversal of 1402314244157 is 7514424132041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1147000302361 + 255313941796 = 1070981^2 + 505286^2 .
It is a cyclic number.
It is not a de Polignac number, because 1402314244157 - 24 = 1402314244141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1402314244157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1402314244151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 701157122078 + 701157122079.
It is an arithmetic number, because the mean of its divisors is an integer number (701157122079).
Almost surely, 21402314244157 is an apocalyptic number.
It is an amenable number.
1402314244157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1402314244157 is an equidigital number, since it uses as much as digits as its factorization.
1402314244157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 107520, while the sum is 38.
Adding to 1402314244157 its reverse (7514424132041), we get a palindrome (8916738376198).
The spelling of 1402314244157 in words is "one trillion, four hundred two billion, three hundred fourteen million, two hundred forty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •