Base | Representation |
---|---|
bin | 1001001001110000011011… |
… | …11011101100101001010011 |
3 | 2122021001212221101120201002 |
4 | 10210320031323230221103 |
5 | 10114222432312032402 |
6 | 110445544055132215 |
7 | 4145042130403136 |
oct | 444701573545123 |
9 | 78231787346632 |
10 | 20126450502227 |
11 | 645a641681a33 |
12 | 231078367406b |
13 | b2cbba9ab314 |
14 | 4d81a816221d |
15 | 24d8062b1602 |
hex | 124e0deeca53 |
20126450502227 has 4 divisors (see below), whose sum is σ = 20128492355496. Its totient is φ = 20124408648960.
The previous prime is 20126450502181. The next prime is 20126450502239. The reversal of 20126450502227 is 72220505462102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20126450502227 - 240 = 19026938874451 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20126450504227) 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 3 ways as a sum of consecutive naturals, for example, 1020911849 + ... + 1020931562.
It is an arithmetic number, because the mean of its divisors is an integer number (5032123088874).
Almost surely, 220126450502227 is an apocalyptic number.
20126450502227 is a deficient number, since it is larger than the sum of its proper divisors (2041853269).
20126450502227 is an equidigital number, since it uses as much as digits as its factorization.
20126450502227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2041853268.
The product of its (nonzero) digits is 134400, while the sum is 38.
Adding to 20126450502227 its reverse (72220505462102), we get a palindrome (92346955964329).
The spelling of 20126450502227 in words is "twenty trillion, one hundred twenty-six billion, four hundred fifty million, five hundred two thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •