Base | Representation |
---|---|
bin | 11011011011111101… |
… | …00000101010001011 |
3 | 1102000120002210100121 |
4 | 31231332200222023 |
5 | 220131340131011 |
6 | 10433351044111 |
7 | 1031010656242 |
oct | 155576405213 |
9 | 42016083317 |
10 | 14730005131 |
11 | 6279781966 |
12 | 2a31070637 |
13 | 150992568a |
14 | 9da421959 |
15 | 5b3280e71 |
hex | 36dfa0a8b |
14730005131 has 8 divisors (see below), whose sum is σ = 15091471584. Its totient is φ = 14372816640.
The previous prime is 14730005123. The next prime is 14730005183. The reversal of 14730005131 is 13150003741.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14730005131 - 23 = 14730005123 is a prime.
It is a super-2 number, since 2×147300051312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14730005096 and 14730005105.
It is not an unprimeable number, because it can be changed into a prime (14730005111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1062520 + ... + 1076293.
It is an arithmetic number, because the mean of its divisors is an integer number (1886433948).
Almost surely, 214730005131 is an apocalyptic number.
14730005131 is a deficient number, since it is larger than the sum of its proper divisors (361466453).
14730005131 is an equidigital number, since it uses as much as digits as its factorization.
14730005131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2138981.
The product of its (nonzero) digits is 1260, while the sum is 25.
Adding to 14730005131 its reverse (13150003741), we get a palindrome (27880008872).
The spelling of 14730005131 in words is "fourteen billion, seven hundred thirty million, five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •