Base | Representation |
---|---|
bin | 1111000001110… |
… | …11100011100101 |
3 | 22210020011201122 |
4 | 13200323203211 |
5 | 224233314221 |
6 | 20302103325 |
7 | 3060413642 |
oct | 740734345 |
9 | 283204648 |
10 | 126073061 |
11 | 6518a614 |
12 | 3627ab45 |
13 | 2017225a |
14 | 12a5adc9 |
15 | b104eab |
hex | 783b8e5 |
126073061 has 4 divisors (see below), whose sum is σ = 128451852. Its totient is φ = 123694272.
The previous prime is 126073043. The next prime is 126073069. The reversal of 126073061 is 160370621.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 160370621 = 19 ⋅8440559.
It can be written as a sum of positive squares in 2 ways, for example, as 63504961 + 62568100 = 7969^2 + 7910^2 .
It is a cyclic number.
It is not a de Polignac number, because 126073061 - 214 = 126056677 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 126073061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126073069) 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, 1189316 + ... + 1189421.
It is an arithmetic number, because the mean of its divisors is an integer number (32112963).
Almost surely, 2126073061 is an apocalyptic number.
It is an amenable number.
126073061 is a deficient number, since it is larger than the sum of its proper divisors (2378791).
126073061 is an equidigital number, since it uses as much as digits as its factorization.
126073061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2378790.
The product of its (nonzero) digits is 1512, while the sum is 26.
The square root of 126073061 is about 11228.2260842931. The cubic root of 126073061 is about 501.4266733346.
The spelling of 126073061 in words is "one hundred twenty-six million, seventy-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •