Base | Representation |
---|---|
bin | 10101000110100111011… |
… | …011111111110100101011 |
3 | 12010122020211211020100122 |
4 | 111012213123333310223 |
5 | 142230014024110011 |
6 | 3030115123553455 |
7 | 206526430033616 |
oct | 25064733776453 |
9 | 5118224736318 |
10 | 1450213113131 |
11 | 50a03954a3a2 |
12 | 1b508952b88b |
13 | a69a6872733 |
14 | 5029537317d |
15 | 27acb59e3db |
hex | 151a76ffd2b |
1450213113131 has 2 divisors, whose sum is σ = 1450213113132. Its totient is φ = 1450213113130.
The previous prime is 1450213113113. The next prime is 1450213113137. The reversal of 1450213113131 is 1313113120541.
Together with previous prime (1450213113113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1450213113131 - 218 = 1450212850987 is a prime.
It is a super-2 number, since 2×14502131131312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1450213113131.
It is not a weakly prime, because it can be changed into another prime (1450213113137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 725106556565 + 725106556566.
It is an arithmetic number, because the mean of its divisors is an integer number (725106556566).
Almost surely, 21450213113131 is an apocalyptic number.
1450213113131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1450213113131 is an equidigital number, since it uses as much as digits as its factorization.
1450213113131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 1450213113131 its reverse (1313113120541), we get a palindrome (2763326233672).
The spelling of 1450213113131 in words is "one trillion, four hundred fifty billion, two hundred thirteen million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •