Base | Representation |
---|---|
bin | 10100101010101001111… |
… | …011011001000000000001 |
3 | 12000202202111021110200022 |
4 | 110222221323121000001 |
5 | 141232022133013311 |
6 | 3004232031103225 |
7 | 204414430615256 |
oct | 24525173310001 |
9 | 5022674243608 |
10 | 1420190126081 |
11 | 4a8332335901 |
12 | 1ab2aa971b15 |
13 | a3c007bc73c |
14 | 4ca47c6342d |
15 | 26e209345db |
hex | 14aa9ed9001 |
1420190126081 has 2 divisors, whose sum is σ = 1420190126082. Its totient is φ = 1420190126080.
The previous prime is 1420190126059. The next prime is 1420190126099. The reversal of 1420190126081 is 1806210910241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 717637708225 + 702552417856 = 847135^2 + 838184^2 .
It is a cyclic number.
It is not a de Polignac number, because 1420190126081 - 222 = 1420185931777 is a prime.
It is a super-2 number, since 2×14201901260812 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1420190126021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 710095063040 + 710095063041.
It is an arithmetic number, because the mean of its divisors is an integer number (710095063041).
Almost surely, 21420190126081 is an apocalyptic number.
It is an amenable number.
1420190126081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1420190126081 is an equidigital number, since it uses as much as digits as its factorization.
1420190126081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 35.
The spelling of 1420190126081 in words is "one trillion, four hundred twenty billion, one hundred ninety million, one hundred twenty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •