Base | Representation |
---|---|
bin | 111111000111000100010001… |
… | …1001000011011110001001100 |
3 | 2200210112102221112221120021200 |
4 | 1332032020203020123301030 |
5 | 1040230132212234441302 |
6 | 5244352542301025500 |
7 | 224633315533366326 |
oct | 17616104310336114 |
9 | 2623472845846250 |
10 | 555125112421452 |
11 | 150975268975431 |
12 | 52316b70b55290 |
13 | 1aa9a0c5596421 |
14 | 9b122ad71a616 |
15 | 442a12899681c |
hex | 1f8e22321bc4c |
555125112421452 has 72 divisors (see below), whose sum is σ = 1442555966316192. Its totient is φ = 179865949420800.
The previous prime is 555125112421391. The next prime is 555125112421459. The reversal of 555125112421452 is 254124211521555.
555125112421452 is a `hidden beast` number, since 5 + 5 + 5 + 1 + 2 + 51 + 124 + 21 + 452 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 555125112421398 and 555125112421407.
It is not an unprimeable number, because it can be changed into a prime (555125112421459) 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 23 ways as a sum of consecutive naturals, for example, 200741449 + ... + 203488032.
Almost surely, 2555125112421452 is an apocalyptic number.
It is an amenable number.
555125112421452 is an abundant number, since it is smaller than the sum of its proper divisors (887430853894740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
555125112421452 is a wasteful number, since it uses less digits than its factorization.
555125112421452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404230559 (or 404230554 counting only the distinct ones).
The product of its digits is 800000, while the sum is 45.
The spelling of 555125112421452 in words is "five hundred fifty-five trillion, one hundred twenty-five billion, one hundred twelve million, four hundred twenty-one thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •