Base | Representation |
---|---|
bin | 1101111001011101000010… |
… | …11110101111110110000111 |
3 | 11000012122022121200000022111 |
4 | 12330232201132233312013 |
5 | 13001204222241044421 |
6 | 144555414121441451 |
7 | 6302663006416303 |
oct | 674564136576607 |
9 | 130178277600274 |
10 | 30561401503111 |
11 | 9813021461646 |
12 | 3517007640287 |
13 | 1408c0a4a0b8b |
14 | 779273246d03 |
15 | 37ee8b1eeee1 |
hex | 1bcba17afd87 |
30561401503111 has 4 divisors (see below), whose sum is σ = 32359131003312. Its totient is φ = 28763672002912.
The previous prime is 30561401503109. The next prime is 30561401503141. The reversal of 30561401503111 is 11130510416503.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30561401503111 - 21 = 30561401503109 is a prime.
It is a super-3 number, since 3×305614015031113 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30561401503141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 898864750075 + ... + 898864750108.
It is an arithmetic number, because the mean of its divisors is an integer number (8089782750828).
Almost surely, 230561401503111 is an apocalyptic number.
30561401503111 is a deficient number, since it is larger than the sum of its proper divisors (1797729500201).
30561401503111 is a wasteful number, since it uses less digits than its factorization.
30561401503111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1797729500200.
The product of its (nonzero) digits is 5400, while the sum is 31.
Adding to 30561401503111 its reverse (11130510416503), we get a palindrome (41691911919614).
The spelling of 30561401503111 in words is "thirty trillion, five hundred sixty-one billion, four hundred one million, five hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •