Base | Representation |
---|---|
bin | 111010110001101101… |
… | …0000000101100100011 |
3 | 110001210121121112112212 |
4 | 1311203122000230203 |
5 | 4032000241031223 |
6 | 133552511312335 |
7 | 12055615502315 |
oct | 1654332005443 |
9 | 401717545485 |
10 | 126221814563 |
11 | 49591a18529 |
12 | 2056751b6ab |
13 | bb97207750 |
14 | 61757b57b5 |
15 | 343b306278 |
hex | 1d63680b23 |
126221814563 has 32 divisors (see below), whose sum is σ = 148043064960. Its totient is φ = 106676444160.
The previous prime is 126221814553. The next prime is 126221814577. The reversal of 126221814563 is 365418122621.
It is not a de Polignac number, because 126221814563 - 28 = 126221814307 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41).
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 126221814563.
It is not an unprimeable number, because it can be changed into a prime (126221814553) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 552593 + ... + 746861.
It is an arithmetic number, because the mean of its divisors is an integer number (4626345780).
Almost surely, 2126221814563 is an apocalyptic number.
126221814563 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
126221814563 is a deficient number, since it is larger than the sum of its proper divisors (21821250397).
126221814563 is a wasteful number, since it uses less digits than its factorization.
126221814563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194399.
The product of its digits is 138240, while the sum is 41.
The spelling of 126221814563 in words is "one hundred twenty-six billion, two hundred twenty-one million, eight hundred fourteen thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •