Base | Representation |
---|---|
bin | 10101000111000001000… |
… | …110001110100101101101 |
3 | 12010200100211212221121112 |
4 | 111013001012032211231 |
5 | 142231404231122221 |
6 | 3030225543041405 |
7 | 206543205161435 |
oct | 25070106164555 |
9 | 5120324787545 |
10 | 1450643614061 |
11 | 50a23a558094 |
12 | 1b5189740265 |
13 | a6a44b03005 |
14 | 502d65d72c5 |
15 | 27b0428a15b |
hex | 151c118e96d |
1450643614061 has 2 divisors, whose sum is σ = 1450643614062. Its totient is φ = 1450643614060.
The previous prime is 1450643614051. The next prime is 1450643614073. The reversal of 1450643614061 is 1604163460541.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1064598858436 + 386044755625 = 1031794^2 + 621325^2 .
It is an emirp because it is prime and its reverse (1604163460541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1450643614061 - 26 = 1450643613997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1450643614051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 725321807030 + 725321807031.
It is an arithmetic number, because the mean of its divisors is an integer number (725321807031).
Almost surely, 21450643614061 is an apocalyptic number.
It is an amenable number.
1450643614061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1450643614061 is an equidigital number, since it uses as much as digits as its factorization.
1450643614061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 207360, while the sum is 41.
The spelling of 1450643614061 in words is "one trillion, four hundred fifty billion, six hundred forty-three million, six hundred fourteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •