Base | Representation |
---|---|
bin | 11001011101111111100101… |
… | …11110010110000011000010 |
3 | 21100022010200020102022112222 |
4 | 30232333302332112003002 |
5 | 24320101101140031200 |
6 | 315040512235251042 |
7 | 14540211505532561 |
oct | 1456776276260302 |
9 | 240263606368488 |
10 | 56006155002050 |
11 | 1693309346a6a0 |
12 | 634644bba9a82 |
13 | 2533485cac406 |
14 | db89d8a33bd8 |
15 | 671cae14bd85 |
hex | 32eff2f960c2 |
56006155002050 has 48 divisors (see below), whose sum is σ = 113770572529824. Its totient is φ = 20342757600000.
The previous prime is 56006155001987. The next prime is 56006155002053. The reversal of 56006155002050 is 5020055160065.
It is a super-2 number, since 2×560061550020502 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 56006155002050.
It is not an unprimeable number, because it can be changed into a prime (56006155002053) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 57307376 + ... + 58276475.
It is an arithmetic number, because the mean of its divisors is an integer number (2370220261038).
Almost surely, 256006155002050 is an apocalyptic number.
56006155002050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56006155002050 is an abundant number, since it is smaller than the sum of its proper divisors (57764417527774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56006155002050 is a wasteful number, since it uses less digits than its factorization.
56006155002050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115584755 (or 115584750 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 35.
The spelling of 56006155002050 in words is "fifty-six trillion, six billion, one hundred fifty-five million, two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •