Base | Representation |
---|---|
bin | 11111000011110110101… |
… | …110000011001001001111 |
3 | 21120001101000011012010222 |
4 | 133003312232003021033 |
5 | 234432314404423310 |
6 | 4312314414021555 |
7 | 310131326351510 |
oct | 37036656031117 |
9 | 7501330135128 |
10 | 2134443045455 |
11 | 7532374aa806 |
12 | 2a58047a78bb |
13 | 12637aa90986 |
14 | 7544407aa07 |
15 | 3a7c5e2e055 |
hex | 1f0f6b8324f |
2134443045455 has 16 divisors (see below), whose sum is σ = 2968464858624. Its totient is φ = 1443003747360.
The previous prime is 2134443045451. The next prime is 2134443045503. The reversal of 2134443045455 is 5545403444312.
It is not a de Polignac number, because 2134443045455 - 22 = 2134443045451 is a prime.
It is a super-2 number, since 2×21344430454552 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2134443045451) 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 15 ways as a sum of consecutive naturals, for example, 429462917 + ... + 429467886.
It is an arithmetic number, because the mean of its divisors is an integer number (185529053664).
Almost surely, 22134443045455 is an apocalyptic number.
2134443045455 is a deficient number, since it is larger than the sum of its proper divisors (834021813169).
2134443045455 is an equidigital number, since it uses as much as digits as its factorization.
2134443045455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 858930886.
The product of its (nonzero) digits is 2304000, while the sum is 44.
Adding to 2134443045455 its reverse (5545403444312), we get a palindrome (7679846489767).
The spelling of 2134443045455 in words is "two trillion, one hundred thirty-four billion, four hundred forty-three million, forty-five thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •