Base | Representation |
---|---|
bin | 10100101110101010111… |
… | …000010001011011011111 |
3 | 12001011212221001020212212 |
4 | 110232222320101123133 |
5 | 141314334232200101 |
6 | 3010223505151035 |
7 | 204626315111621 |
oct | 24565270213337 |
9 | 5034787036785 |
10 | 1424501053151 |
11 | 4aa144787150 |
12 | 1b00b262b47b |
13 | a4439966767 |
14 | 4cd365d2c11 |
15 | 270c41261bb |
hex | 14baae116df |
1424501053151 has 4 divisors (see below), whose sum is σ = 1554001148904. Its totient is φ = 1295000957400.
The previous prime is 1424501053147. The next prime is 1424501053163. The reversal of 1424501053151 is 1513501054241.
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 1424501053151 - 22 = 1424501053147 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 (1424501053121) 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, 64750047860 + ... + 64750047881.
It is an arithmetic number, because the mean of its divisors is an integer number (388500287226).
Almost surely, 21424501053151 is an apocalyptic number.
1424501053151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1424501053151 is a deficient number, since it is larger than the sum of its proper divisors (129500095753).
1424501053151 is a wasteful number, since it uses less digits than its factorization.
1424501053151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129500095752.
The product of its (nonzero) digits is 12000, while the sum is 32.
The spelling of 1424501053151 in words is "one trillion, four hundred twenty-four billion, five hundred one million, fifty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •