Base | Representation |
---|---|
bin | 1010111101011010100100… |
… | …0111000001001010001001 |
3 | 1120122222201120201112012011 |
4 | 2233112221013001022021 |
5 | 3034412322414021122 |
6 | 41343443404415521 |
7 | 2352412460563606 |
oct | 257265107011211 |
9 | 46588646645164 |
10 | 12050220454537 |
11 | 3926519330691 |
12 | 14274b65475a1 |
13 | 69543c028b85 |
14 | 2d933b6d76ad |
15 | 15d6c1d10377 |
hex | af5a91c1289 |
12050220454537 has 2 divisors, whose sum is σ = 12050220454538. Its totient is φ = 12050220454536.
The previous prime is 12050220454471. The next prime is 12050220454541. The reversal of 12050220454537 is 73545402205021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9498163084281 + 2552057370256 = 3081909^2 + 1597516^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12050220454537 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12050220454537.
It is not a weakly prime, because it can be changed into another prime (12050220464537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6025110227268 + 6025110227269.
It is an arithmetic number, because the mean of its divisors is an integer number (6025110227269).
Almost surely, 212050220454537 is an apocalyptic number.
It is an amenable number.
12050220454537 is a deficient number, since it is larger than the sum of its proper divisors (1).
12050220454537 is an equidigital number, since it uses as much as digits as its factorization.
12050220454537 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336000, while the sum is 40.
Adding to 12050220454537 its reverse (73545402205021), we get a palindrome (85595622659558).
The spelling of 12050220454537 in words is "twelve trillion, fifty billion, two hundred twenty million, four hundred fifty-four thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •