Base | Representation |
---|---|
bin | 11110101011010000010… |
… | …10010110011101111011 |
3 | 10201202121002021220221221 |
4 | 33111220022112131323 |
5 | 114232110210001301 |
6 | 2124112501212511 |
7 | 136102314460060 |
oct | 17255012263573 |
9 | 3652532256857 |
10 | 1054014531451 |
11 | 3770067a7932 |
12 | 150337401137 |
13 | 7851597725b |
14 | 3902bdd0c67 |
15 | 1c63d7a1da1 |
hex | f56829677b |
1054014531451 has 4 divisors (see below), whose sum is σ = 1204588035952. Its totient is φ = 903441026952.
The previous prime is 1054014531431. The next prime is 1054014531499. The reversal of 1054014531451 is 1541354104501.
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 1054014531451 - 215 = 1054014498683 is a prime.
It is a super-2 number, since 2×10540145314512 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1054014531431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75286752240 + ... + 75286752253.
It is an arithmetic number, because the mean of its divisors is an integer number (301147008988).
Almost surely, 21054014531451 is an apocalyptic number.
1054014531451 is a deficient number, since it is larger than the sum of its proper divisors (150573504501).
1054014531451 is an equidigital number, since it uses as much as digits as its factorization.
1054014531451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150573504500.
The product of its (nonzero) digits is 24000, while the sum is 34.
Adding to 1054014531451 its reverse (1541354104501), we get a palindrome (2595368635952).
The spelling of 1054014531451 in words is "one trillion, fifty-four billion, fourteen million, five hundred thirty-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •