Base | Representation |
---|---|
bin | 10000110001010110100… |
… | …111011111111101110011 |
3 | 11002011211000102012001222 |
4 | 100301112213133331303 |
5 | 122340312113233301 |
6 | 2241241521415255 |
7 | 146160064010543 |
oct | 20612647377563 |
9 | 4064730365058 |
10 | 1152504430451 |
11 | 404857783780 |
12 | 16744349a52b |
13 | 848b0668bba |
14 | 3dad267d323 |
15 | 1eea514931b |
hex | 10c569dff73 |
1152504430451 has 4 divisors (see below), whose sum is σ = 1257277560504. Its totient is φ = 1047731300400.
The previous prime is 1152504430439. The next prime is 1152504430459. The reversal of 1152504430451 is 1540344052511.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1152504430451 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1152504430459) 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, 52386565010 + ... + 52386565031.
It is an arithmetic number, because the mean of its divisors is an integer number (314319390126).
Almost surely, 21152504430451 is an apocalyptic number.
1152504430451 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1152504430451 is a deficient number, since it is larger than the sum of its proper divisors (104773130053).
1152504430451 is a wasteful number, since it uses less digits than its factorization.
1152504430451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104773130052.
The product of its (nonzero) digits is 48000, while the sum is 35.
Adding to 1152504430451 its reverse (1540344052511), we get a palindrome (2692848482962).
The spelling of 1152504430451 in words is "one trillion, one hundred fifty-two billion, five hundred four million, four hundred thirty thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •