Base | Representation |
---|---|
bin | 11001100001010111011000… |
… | …10111010011001101110011 |
3 | 21100201012201020200121012201 |
4 | 30300223230113103031303 |
5 | 24324000333101024111 |
6 | 315210032240004031 |
7 | 14551452452615131 |
oct | 1460535427231563 |
9 | 240635636617181 |
10 | 56122008220531 |
11 | 169782345a7450 |
12 | 63649a3000617 |
13 | 254138a0320b6 |
14 | dc0469338751 |
15 | 674ce00366c1 |
hex | 330aec5d3373 |
56122008220531 has 4 divisors (see below), whose sum is σ = 61224008967864. Its totient is φ = 51020007473200.
The previous prime is 56122008220507. The next prime is 56122008220549. The reversal of 56122008220531 is 13502280022165.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 56122008220531 - 237 = 55984569267059 is a prime.
It is a super-2 number, since 2×561220082205312 (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 (56122008223531) 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, 2551000373650 + ... + 2551000373671.
It is an arithmetic number, because the mean of its divisors is an integer number (15306002241966).
Almost surely, 256122008220531 is an apocalyptic number.
56122008220531 is a deficient number, since it is larger than the sum of its proper divisors (5102000747333).
56122008220531 is a wasteful number, since it uses less digits than its factorization.
56122008220531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5102000747332.
The product of its (nonzero) digits is 57600, while the sum is 37.
Adding to 56122008220531 its reverse (13502280022165), we get a palindrome (69624288242696).
The spelling of 56122008220531 in words is "fifty-six trillion, one hundred twenty-two billion, eight million, two hundred twenty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •