Base | Representation |
---|---|
bin | 111011000000100010… |
… | …1110001110001000101 |
3 | 110010002022201012012102 |
4 | 1312001011301301011 |
5 | 4034010233431023 |
6 | 134114141401445 |
7 | 12104143520543 |
oct | 1660105616105 |
9 | 403068635172 |
10 | 126719827013 |
11 | 4981804766a |
12 | 20686269285 |
13 | bc46444c80 |
14 | 61c19b0d93 |
15 | 3469dca628 |
hex | 1d81171c45 |
126719827013 has 4 divisors (see below), whose sum is σ = 136467506028. Its totient is φ = 116972148000.
The previous prime is 126719826991. The next prime is 126719827019. The reversal of 126719827013 is 310728917621.
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 26561502529 + 100158324484 = 162977^2 + 316478^2 .
It is a cyclic number.
It is not a de Polignac number, because 126719827013 - 214 = 126719810629 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126719827019) 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, 4873839488 + ... + 4873839513.
It is an arithmetic number, because the mean of its divisors is an integer number (34116876507).
Almost surely, 2126719827013 is an apocalyptic number.
126719827013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
126719827013 is a deficient number, since it is larger than the sum of its proper divisors (9747679015).
126719827013 is an equidigital number, since it uses as much as digits as its factorization.
126719827013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9747679014.
The product of its (nonzero) digits is 254016, while the sum is 47.
The spelling of 126719827013 in words is "one hundred twenty-six billion, seven hundred nineteen million, eight hundred twenty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •