Base | Representation |
---|---|
bin | 1101111000111100110101… |
… | …00010011100001101100010 |
3 | 11000010222200012112211020020 |
4 | 12330132122202130031202 |
5 | 13000413311410132240 |
6 | 144543433533054310 |
7 | 6301511254063500 |
oct | 674363242341542 |
9 | 130128605484206 |
10 | 30544105161570 |
11 | 9806756098200 |
12 | 351379b027396 |
13 | 14073b1c90c60 |
14 | 7784b2067670 |
15 | 37e7c79dd0d0 |
hex | 1bc79a89c362 |
30544105161570 has 288 divisors, whose sum is σ = 100941187725504. Its totient is φ = 5858609137920.
The previous prime is 30544105161551. The next prime is 30544105161571. The reversal of 30544105161570 is 7516150144503.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (30544105161571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 4292364 + ... + 8916983.
It is an arithmetic number, because the mean of its divisors is an integer number (350490235158).
Almost surely, 230544105161570 is an apocalyptic number.
30544105161570 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30544105161570 is an abundant number, since it is smaller than the sum of its proper divisors (70397082563934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30544105161570 is a wasteful number, since it uses less digits than its factorization.
30544105161570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13209406 (or 13209388 counting only the distinct ones).
The product of its (nonzero) digits is 252000, while the sum is 42.
The spelling of 30544105161570 in words is "thirty trillion, five hundred forty-four billion, one hundred five million, one hundred sixty-one thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •