Base | Representation |
---|---|
bin | 111111110100000111001101… |
… | …0000010001101001010011101 |
3 | 2201121110022002222002022121000 |
4 | 1333220032122002031022131 |
5 | 1042033100441204313010 |
6 | 5305453025400500513 |
7 | 226142516411330442 |
oct | 17750163202151235 |
9 | 2647408088068530 |
10 | 561316155151005 |
11 | 152941932112131 |
12 | 52b569b877a739 |
13 | 1b128b6a2a6157 |
14 | 9c87bbdb399c9 |
15 | 44d61c48177c0 |
hex | 1fe839a08d29d |
561316155151005 has 64 divisors (see below), whose sum is σ = 1011958637437440. Its totient is φ = 295149710822400.
The previous prime is 561316155150979. The next prime is 561316155151007. The reversal of 561316155151005 is 500151551613165.
561316155151005 is a `hidden beast` number, since 5 + 6 + 1 + 3 + 1 + 615 + 5 + 15 + 10 + 0 + 5 = 666.
It is not a de Polignac number, because 561316155151005 - 25 = 561316155150973 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (561316155151007) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2155354179 + ... + 2155614591.
It is an arithmetic number, because the mean of its divisors is an integer number (15811853709960).
Almost surely, 2561316155151005 is an apocalyptic number.
It is an amenable number.
561316155151005 is a deficient number, since it is larger than the sum of its proper divisors (450642482286435).
561316155151005 is a wasteful number, since it uses less digits than its factorization.
561316155151005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485379 (or 485373 counting only the distinct ones).
The product of its (nonzero) digits is 337500, while the sum is 45.
The spelling of 561316155151005 in words is "five hundred sixty-one trillion, three hundred sixteen billion, one hundred fifty-five million, one hundred fifty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •