Base | Representation |
---|---|
bin | 1101110111110010110111… |
… | …11011110100011011101111 |
3 | 11000000012012002112221201001 |
4 | 12323321123323310123233 |
5 | 12444241002414102421 |
6 | 144513310012501131 |
7 | 6265604321024215 |
oct | 673713373643357 |
9 | 130005162487631 |
10 | 30504400144111 |
11 | 97a09306a6993 |
12 | 3507b59a7a7a7 |
13 | 140372507079a |
14 | 7765c6b24cb5 |
15 | 37d751d73691 |
hex | 1bbe5bef46ef |
30504400144111 has 4 divisors (see below), whose sum is σ = 30504466208992. Its totient is φ = 30504334079232.
The previous prime is 30504400144081. The next prime is 30504400144117. The reversal of 30504400144111 is 11144100440503.
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 30504400144111 - 233 = 30495810209519 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 30504400144111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30504400144117) 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, 32334930 + ... + 33264943.
It is an arithmetic number, because the mean of its divisors is an integer number (7626116552248).
Almost surely, 230504400144111 is an apocalyptic number.
30504400144111 is a deficient number, since it is larger than the sum of its proper divisors (66064881).
30504400144111 is an equidigital number, since it uses as much as digits as its factorization.
30504400144111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66064880.
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 30504400144111 its reverse (11144100440503), we get a palindrome (41648500584614).
The spelling of 30504400144111 in words is "thirty trillion, five hundred four billion, four hundred million, one hundred forty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •