Base | Representation |
---|---|
bin | 111010101011100101… |
… | …0101110011101000101 |
3 | 110001021022020111222112 |
4 | 1311113022232131011 |
5 | 4031040204343333 |
6 | 133520254310405 |
7 | 12050543262416 |
oct | 1652712563505 |
9 | 401238214875 |
10 | 126016481093 |
11 | 49497022448 |
12 | 2050a7b8405 |
13 | bb63803959 |
14 | 615640580d |
15 | 3428296948 |
hex | 1d572ae745 |
126016481093 has 4 divisors (see below), whose sum is σ = 126656158860. Its totient is φ = 125376803328.
The previous prime is 126016481089. The next prime is 126016481119. The reversal of 126016481093 is 390184610621.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 114784084804 + 11232396289 = 338798^2 + 105983^2 .
It is a cyclic number.
It is not a de Polignac number, because 126016481093 - 22 = 126016481089 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 126016481093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126016481033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 319838588 + ... + 319838981.
It is an arithmetic number, because the mean of its divisors is an integer number (31664039715).
Almost surely, 2126016481093 is an apocalyptic number.
It is an amenable number.
126016481093 is a deficient number, since it is larger than the sum of its proper divisors (639677767).
126016481093 is an equidigital number, since it uses as much as digits as its factorization.
126016481093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 639677766.
The product of its (nonzero) digits is 62208, while the sum is 41.
The spelling of 126016481093 in words is "one hundred twenty-six billion, sixteen million, four hundred eighty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •