Base | Representation |
---|---|
bin | 1101101100011100011100… |
… | …11111011100110101011101 |
3 | 10221121220112202101001121211 |
4 | 12312032032133130311131 |
5 | 12421343301004242001 |
6 | 144014211155424421 |
7 | 6225460030154065 |
oct | 666161637346535 |
9 | 127556482331554 |
10 | 30114406321501 |
11 | 96604a2318787 |
12 | 34644598b5111 |
13 | 13a5a127a3588 |
14 | 76178b8523a5 |
15 | 373528b58351 |
hex | 1b638e7dcd5d |
30114406321501 has 4 divisors (see below), whose sum is σ = 30123612807904. Its totient is φ = 30105199835100.
The previous prime is 30114406321487. The next prime is 30114406321511. The reversal of 30114406321501 is 10512360441103.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30114406321501 - 229 = 30113869450589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30114406321511) 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, 4603238295 + ... + 4603244836.
It is an arithmetic number, because the mean of its divisors is an integer number (7530903201976).
Almost surely, 230114406321501 is an apocalyptic number.
It is an amenable number.
30114406321501 is a deficient number, since it is larger than the sum of its proper divisors (9206486403).
30114406321501 is an equidigital number, since it uses as much as digits as its factorization.
30114406321501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9206486402.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 30114406321501 its reverse (10512360441103), we get a palindrome (40626766762604).
The spelling of 30114406321501 in words is "thirty trillion, one hundred fourteen billion, four hundred six million, three hundred twenty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •