Base | Representation |
---|---|
bin | 1101111001000100100001… |
… | …00001110101010000101000 |
3 | 11000011101022211021221202020 |
4 | 12330202100201311100220 |
5 | 13001000234420302120 |
6 | 144545355241504440 |
7 | 6302015446233306 |
oct | 674422041652050 |
9 | 130141284257666 |
10 | 30548232197160 |
11 | 9808483759117 |
12 | 35145511a2120 |
13 | 14078bc000a52 |
14 | 778784209276 |
15 | 37e969ea8640 |
hex | 1bc890875428 |
30548232197160 has 32 divisors (see below), whose sum is σ = 91644696591840. Its totient is φ = 8146195252544.
The previous prime is 30548232197149. The next prime is 30548232197207. The reversal of 30548232197160 is 6179123284503.
It is a super-2 number, since 2×305482321971602 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 127284300702 + ... + 127284300941.
It is an arithmetic number, because the mean of its divisors is an integer number (2863896768495).
It is a 1-persistent number, because it is pandigital, but 2⋅30548232197160 = 61096464394320 is not.
Almost surely, 230548232197160 is an apocalyptic number.
30548232197160 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30548232197160 is an abundant number, since it is smaller than the sum of its proper divisors (61096464394680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30548232197160 is a wasteful number, since it uses less digits than its factorization.
30548232197160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 254568601657 (or 254568601653 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 51.
The spelling of 30548232197160 in words is "thirty trillion, five hundred forty-eight billion, two hundred thirty-two million, one hundred ninety-seven thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •