Base | Representation |
---|---|
bin | 11100101101010000001011… |
… | …110010111001110000010011 |
3 | 121120000212100222011121002211 |
4 | 130231100023302321300103 |
5 | 113022030323432320410 |
6 | 1124304434450252551 |
7 | 35410424666331421 |
oct | 3455201362716023 |
9 | 546025328147084 |
10 | 126255056526355 |
11 | 37257517a45a09 |
12 | 121b10aab87157 |
13 | 555aa54309083 |
14 | 2326ac5048111 |
15 | e8e2b52c768a |
hex | 72d40bcb9c13 |
126255056526355 has 8 divisors (see below), whose sum is σ = 151562327063472. Its totient is φ = 100966539066528.
The previous prime is 126255056526341. The next prime is 126255056526377. The reversal of 126255056526355 is 553625650552621.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 126255056526355 - 237 = 126117617572883 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 126255056526355.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 4688254509 + ... + 4688281438.
It is an arithmetic number, because the mean of its divisors is an integer number (18945290882934).
Almost surely, 2126255056526355 is an apocalyptic number.
126255056526355 is a deficient number, since it is larger than the sum of its proper divisors (25307270537117).
126255056526355 is an equidigital number, since it uses as much as digits as its factorization.
126255056526355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9376538645.
The product of its (nonzero) digits is 81000000, while the sum is 58.
The spelling of 126255056526355 in words is "one hundred twenty-six trillion, two hundred fifty-five billion, fifty-six million, five hundred twenty-six thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •