Base | Representation |
---|---|
bin | 10100101100101001011001… |
… | …11010101101110011111101 |
3 | 12222011010221022000011111212 |
4 | 22112110230322231303331 |
5 | 21431202220114301323 |
6 | 240445025513254205 |
7 | 12405213166623263 |
oct | 1226245472556375 |
9 | 188133838004455 |
10 | 45514522025213 |
11 | 1355866713855a |
12 | 5131029404365 |
13 | 1c520022b2907 |
14 | b34cb3a08433 |
15 | 53de0ce1db78 |
hex | 29652ceadcfd |
45514522025213 has 4 divisors (see below), whose sum is σ = 45519476265600. Its totient is φ = 45509567784828.
The previous prime is 45514522025207. The next prime is 45514522025279. The reversal of 45514522025213 is 31252022541554.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 45514522025213 - 214 = 45514522008829 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45514522025513) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2477106413 + ... + 2477124786.
It is an arithmetic number, because the mean of its divisors is an integer number (11379869066400).
Almost surely, 245514522025213 is an apocalyptic number.
It is an amenable number.
45514522025213 is a deficient number, since it is larger than the sum of its proper divisors (4954240387).
45514522025213 is an equidigital number, since it uses as much as digits as its factorization.
45514522025213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4954240386.
The product of its (nonzero) digits is 480000, while the sum is 41.
Adding to 45514522025213 its reverse (31252022541554), we get a palindrome (76766544566767).
The spelling of 45514522025213 in words is "forty-five trillion, five hundred fourteen billion, five hundred twenty-two million, twenty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •