Base | Representation |
---|---|
bin | 101010000111101000… |
… | …000101011110100001 |
3 | 11022201211000101111111 |
4 | 222013220011132201 |
5 | 1220110111332223 |
6 | 32435350543321 |
7 | 3160502023663 |
oct | 520750053641 |
9 | 138654011444 |
10 | 45225105313 |
11 | 181a8435aa3 |
12 | 8921967b41 |
13 | 435974855b |
14 | 2290508533 |
15 | 129a5a630d |
hex | a87a057a1 |
45225105313 has 4 divisors (see below), whose sum is σ = 45332528788. Its totient is φ = 45117681840.
The previous prime is 45225105311. The next prime is 45225105361. The reversal of 45225105313 is 31350152254.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 639938209 + 44585167104 = 25297^2 + 211152^2 .
It is a cyclic number.
It is not a de Polignac number, because 45225105313 - 21 = 45225105311 is a prime.
It is a super-3 number, since 3×452251053133 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (45225105311) 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, 53711106 + ... + 53711947.
It is an arithmetic number, because the mean of its divisors is an integer number (11333132197).
Almost surely, 245225105313 is an apocalyptic number.
It is an amenable number.
45225105313 is a deficient number, since it is larger than the sum of its proper divisors (107423475).
45225105313 is a wasteful number, since it uses less digits than its factorization.
45225105313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107423474.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 45225105313 its reverse (31350152254), we get a palindrome (76575257567).
The spelling of 45225105313 in words is "forty-five billion, two hundred twenty-five million, one hundred five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •