Base | Representation |
---|---|
bin | 100000011011000011000… |
… | …1111101100000100001111 |
3 | 120210000001121001110221011 |
4 | 1000312012033230010033 |
5 | 1041002130114024201 |
6 | 13251041442350051 |
7 | 636642065321566 |
oct | 100660617540417 |
9 | 16700047043834 |
10 | 4456133345551 |
11 | 1468921114338 |
12 | 5bb76605b327 |
13 | 264299a8ca34 |
14 | 11596c632bdd |
15 | 7adaa921151 |
hex | 40d863ec10f |
4456133345551 has 4 divisors (see below), whose sum is σ = 4456416524112. Its totient is φ = 4455850166992.
The previous prime is 4456133345549. The next prime is 4456133345593. The reversal of 4456133345551 is 1555433316544.
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 4456133345551 - 21 = 4456133345549 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4456133345495 and 4456133345504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4456133340551) 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 3 ways as a sum of consecutive naturals, for example, 141565675 + ... + 141597148.
It is an arithmetic number, because the mean of its divisors is an integer number (1114104131028).
Almost surely, 24456133345551 is an apocalyptic number.
4456133345551 is a deficient number, since it is larger than the sum of its proper divisors (283178561).
4456133345551 is a wasteful number, since it uses less digits than its factorization.
4456133345551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283178560.
The product of its digits is 6480000, while the sum is 49.
The spelling of 4456133345551 in words is "four trillion, four hundred fifty-six billion, one hundred thirty-three million, three hundred forty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •