Base | Representation |
---|---|
bin | 10010000110000100000… |
… | …011011001100001110111 |
3 | 11101212120221022021220100 |
4 | 102012010003121201313 |
5 | 130333102011011210 |
6 | 2351123233205143 |
7 | 155560060244214 |
oct | 22060403314167 |
9 | 4355527267810 |
10 | 1243461032055 |
11 | 43a392376800 |
12 | 180ba87007b3 |
13 | 90347711a18 |
14 | 4428062cb0b |
15 | 2252a4835c0 |
hex | 121840d9877 |
1243461032055 has 72 divisors (see below), whose sum is σ = 2426867417520. Its totient is φ = 588185452800.
The previous prime is 1243461032039. The next prime is 1243461032069. The reversal of 1243461032055 is 5502301643421.
1243461032055 is a `hidden beast` number, since 1 + 2 + 4 + 3 + 4 + 610 + 32 + 0 + 5 + 5 = 666.
It is not a de Polignac number, because 1243461032055 - 24 = 1243461032039 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2561725 + ... + 3008214.
It is an arithmetic number, because the mean of its divisors is an integer number (33706491910).
Almost surely, 21243461032055 is an apocalyptic number.
1243461032055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1243461032055 is a deficient number, since it is larger than the sum of its proper divisors (1183406385465).
1243461032055 is a wasteful number, since it uses less digits than its factorization.
1243461032055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5570013 (or 5569999 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
Adding to 1243461032055 its reverse (5502301643421), we get a palindrome (6745762675476).
The spelling of 1243461032055 in words is "one trillion, two hundred forty-three billion, four hundred sixty-one million, thirty-two thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •