Base | Representation |
---|---|
bin | 10100101001111010010010… |
… | …10111111011001001001011 |
3 | 12221211011021110002202202211 |
4 | 22110331021113323021023 |
5 | 21423132201100213111 |
6 | 240333521101005551 |
7 | 12365344404161056 |
oct | 1224751127731113 |
9 | 187734243082684 |
10 | 45420510163531 |
11 | 135218039713a8 |
12 | 5116970b538b7 |
13 | 1c4619c277ba9 |
14 | b30515d89a9d |
15 | 53b759777521 |
hex | 294f495fb24b |
45420510163531 has 8 divisors (see below), whose sum is σ = 46815321493728. Its totient is φ = 44046673440000.
The previous prime is 45420510163487. The next prime is 45420510163579. The reversal of 45420510163531 is 13536101502454.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 45420510163531 - 221 = 45420508066379 is a prime.
It is a super-2 number, since 2×454205101635312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (45420510166531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5243647270 + ... + 5243655931.
It is an arithmetic number, because the mean of its divisors is an integer number (5851915186716).
Almost surely, 245420510163531 is an apocalyptic number.
45420510163531 is a deficient number, since it is larger than the sum of its proper divisors (1394811330197).
45420510163531 is a wasteful number, since it uses less digits than its factorization.
45420510163531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10487303333.
The product of its (nonzero) digits is 216000, while the sum is 40.
Adding to 45420510163531 its reverse (13536101502454), we get a palindrome (58956611665985).
The spelling of 45420510163531 in words is "forty-five trillion, four hundred twenty billion, five hundred ten million, one hundred sixty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •