Base | Representation |
---|---|
bin | 11001100001000001111110… |
… | …00001011110010110011001 |
3 | 21100200010000220221212022022 |
4 | 30300200333001132112121 |
5 | 24323303311041343014 |
6 | 315200451255304225 |
7 | 14550564514350302 |
oct | 1460407701362631 |
9 | 240603026855268 |
10 | 56110510106009 |
11 | 1697337417a867 |
12 | 636271437b075 |
13 | 2540276b62938 |
14 | dbda982437a9 |
15 | 67486a8a2a8e |
hex | 33083f05e599 |
56110510106009 has 4 divisors (see below), whose sum is σ = 56482102888320. Its totient is φ = 55738917323700.
The previous prime is 56110510105933. The next prime is 56110510106011. The reversal of 56110510106009 is 90060101501165.
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 56110510106009 - 224 = 56110493328793 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 56110510106009.
It is not an unprimeable number, because it can be changed into a prime (56110510106509) 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, 185796390929 + ... + 185796391230.
It is an arithmetic number, because the mean of its divisors is an integer number (14120525722080).
Almost surely, 256110510106009 is an apocalyptic number.
It is an amenable number.
56110510106009 is a deficient number, since it is larger than the sum of its proper divisors (371592782311).
56110510106009 is a wasteful number, since it uses less digits than its factorization.
56110510106009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 371592782310.
The product of its (nonzero) digits is 8100, while the sum is 35.
The spelling of 56110510106009 in words is "fifty-six trillion, one hundred ten billion, five hundred ten million, one hundred six thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •