Base | Representation |
---|---|
bin | 1110000010011001001111… |
… | …11110111100011110111001 |
3 | 11001022000020212021121111021 |
4 | 13001030213332330132321 |
5 | 13021222343244042231 |
6 | 145352501152102441 |
7 | 6334116463165462 |
oct | 701144776743671 |
9 | 131260225247437 |
10 | 30868600768441 |
11 | 99213334334a7 |
12 | 356665bb34a21 |
13 | 142bb869934a7 |
14 | 78a096575d69 |
15 | 387e6a939811 |
hex | 1c1327fbc7b9 |
30868600768441 has 32 divisors (see below), whose sum is σ = 33969152000000. Its totient is φ = 27939763874880.
The previous prime is 30868600768427. The next prime is 30868600768463. The reversal of 30868600768441 is 14486700686803.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30868600768441 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30868600768441.
It is not an unprimeable number, because it can be changed into a prime (30868600768541) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 651363775 + ... + 651411163.
It is an arithmetic number, because the mean of its divisors is an integer number (1061536000000).
Almost surely, 230868600768441 is an apocalyptic number.
30868600768441 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
30868600768441 is a deficient number, since it is larger than the sum of its proper divisors (3100551231559).
30868600768441 is a wasteful number, since it uses less digits than its factorization.
30868600768441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61517.
The product of its (nonzero) digits is 37158912, while the sum is 61.
The spelling of 30868600768441 in words is "thirty trillion, eight hundred sixty-eight billion, six hundred million, seven hundred sixty-eight thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •