Base | Representation |
---|---|
bin | 10101001010011111010… |
… | …011110000110101011101 |
3 | 12011000222122221112210111 |
4 | 111022133103300311131 |
5 | 142312023124013112 |
6 | 3032043521010021 |
7 | 210034454340661 |
oct | 25123723606535 |
9 | 5130878845714 |
10 | 1454371704157 |
11 | 510882a03389 |
12 | 1b5a4a183911 |
13 | a71ba2b0498 |
14 | 5056b7aa8a1 |
15 | 27c716ee5a7 |
hex | 1529f4f0d5d |
1454371704157 has 2 divisors, whose sum is σ = 1454371704158. Its totient is φ = 1454371704156.
The previous prime is 1454371704127. The next prime is 1454371704217. The reversal of 1454371704157 is 7514071734541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 931477847161 + 522893856996 = 965131^2 + 723114^2 .
It is a cyclic number.
It is not a de Polignac number, because 1454371704157 - 211 = 1454371702109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1454371704157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1454371704127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 727185852078 + 727185852079.
It is an arithmetic number, because the mean of its divisors is an integer number (727185852079).
Almost surely, 21454371704157 is an apocalyptic number.
It is an amenable number.
1454371704157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1454371704157 is an equidigital number, since it uses as much as digits as its factorization.
1454371704157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1646400, while the sum is 49.
The spelling of 1454371704157 in words is "one trillion, four hundred fifty-four billion, three hundred seventy-one million, seven hundred four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •