Base | Representation |
---|---|
bin | 10101001010001111101… |
… | …101111110111010000001 |
3 | 12011000022102202211002012 |
4 | 111022033231332322001 |
5 | 142311004144021311 |
6 | 3032001534502305 |
7 | 210025130162222 |
oct | 25121755767201 |
9 | 5130272684065 |
10 | 1454110142081 |
11 | 5107592a2983 |
12 | 1b5996664995 |
13 | a717805021c |
14 | 50544b61249 |
15 | 27c5878478b |
hex | 1528fb7ee81 |
1454110142081 has 2 divisors, whose sum is σ = 1454110142082. Its totient is φ = 1454110142080.
The previous prime is 1454110142029. The next prime is 1454110142153. The reversal of 1454110142081 is 1802410114541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1013161020481 + 440949121600 = 1006559^2 + 664040^2 .
It is a cyclic number.
It is not a de Polignac number, because 1454110142081 - 214 = 1454110125697 is a prime.
It is a super-3 number, since 3×14541101420813 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (1454110142981) 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, 727055071040 + 727055071041.
It is an arithmetic number, because the mean of its divisors is an integer number (727055071041).
Almost surely, 21454110142081 is an apocalyptic number.
It is an amenable number.
1454110142081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1454110142081 is an equidigital number, since it uses as much as digits as its factorization.
1454110142081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5120, while the sum is 32.
The spelling of 1454110142081 in words is "one trillion, four hundred fifty-four billion, one hundred ten million, one hundred forty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •