Base | Representation |
---|---|
bin | 10110100101001001110… |
… | …011110100100001100100 |
3 | 12111100021010210100010020 |
4 | 112211021303310201210 |
5 | 200410411201440413 |
6 | 3144503453155140 |
7 | 220052051152542 |
oct | 26451163644144 |
9 | 5440233710106 |
10 | 1551721515108 |
11 | 5490993841a6 |
12 | 21089848bab0 |
13 | b3432a2680b |
14 | 55164882d92 |
15 | 2a56ce42c23 |
hex | 16949cf4864 |
1551721515108 has 48 divisors (see below), whose sum is σ = 3816205202880. Its totient is φ = 489981890944.
The previous prime is 1551721515107. The next prime is 1551721515119. The reversal of 1551721515108 is 8015151271551.
It is a self number, because there is not a number n which added to its sum of digits gives 1551721515108.
It is not an unprimeable number, because it can be changed into a prime (1551721515107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42047310 + ... + 42084197.
It is an arithmetic number, because the mean of its divisors is an integer number (79504275060).
Almost surely, 21551721515108 is an apocalyptic number.
It is an amenable number.
1551721515108 is an abundant number, since it is smaller than the sum of its proper divisors (2264483687772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1551721515108 is a wasteful number, since it uses less digits than its factorization.
1551721515108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84131596 (or 84131594 counting only the distinct ones).
The product of its (nonzero) digits is 70000, while the sum is 42.
Adding to 1551721515108 its reverse (8015151271551), we get a palindrome (9566872786659).
The spelling of 1551721515108 in words is "one trillion, five hundred fifty-one billion, seven hundred twenty-one million, five hundred fifteen thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •