Base | Representation |
---|---|
bin | 11001011111101110001001… |
… | …00011010111011111000101 |
3 | 21100111210212111021012010112 |
4 | 30233313010203113133011 |
5 | 24322034123431022021 |
6 | 315124045431202405 |
7 | 14544412332364502 |
oct | 1457670443273705 |
9 | 240453774235115 |
10 | 56065505720261 |
11 | 1695627a399734 |
12 | 6355a54516405 |
13 | 2538c5407749b |
14 | dbb8291924a9 |
15 | 6735d4899d5b |
hex | 32fdc48d77c5 |
56065505720261 has 8 divisors (see below), whose sum is σ = 56209335798360. Its totient is φ = 55921767994368.
The previous prime is 56065505720251. The next prime is 56065505720267. The reversal of 56065505720261 is 16202750556065.
It can be written as a sum of positive squares in 4 ways, for example, as 5061712530625 + 51003793189636 = 2249825^2 + 7141694^2 .
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 56065505720261 - 214 = 56065505703877 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56065505720267) 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, 21872246 + ... + 24300743.
It is an arithmetic number, because the mean of its divisors is an integer number (7026166974795).
Almost surely, 256065505720261 is an apocalyptic number.
It is an amenable number.
56065505720261 is a deficient number, since it is larger than the sum of its proper divisors (143830078099).
56065505720261 is a wasteful number, since it uses less digits than its factorization.
56065505720261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46176103.
The product of its (nonzero) digits is 3780000, while the sum is 50.
The spelling of 56065505720261 in words is "fifty-six trillion, sixty-five billion, five hundred five million, seven hundred twenty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •