Base | Representation |
---|---|
bin | 1111000001111… |
… | …01100100000001 |
3 | 22210020121000002 |
4 | 13200331210001 |
5 | 224234100111 |
6 | 20302205345 |
7 | 3060446624 |
oct | 740754401 |
9 | 283217002 |
10 | 126081281 |
11 | 65195807 |
12 | 36283855 |
13 | 20175c11 |
14 | 12a5ddbb |
15 | b10763b |
hex | 783d901 |
126081281 has 4 divisors (see below), whose sum is σ = 127238100. Its totient is φ = 124924464.
The previous prime is 126081271. The next prime is 126081287. The reversal of 126081281 is 182180621.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 182180621 = 7 ⋅26025803.
It can be written as a sum of positive squares in 2 ways, for example, as 84916225 + 41165056 = 9215^2 + 6416^2 .
It is a de Polignac number, because none of the positive numbers 2k-126081281 is a prime.
It is a super-2 number, since 2×1260812812 = 31792978837201922, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (126081287) 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, 578246 + ... + 578463.
It is an arithmetic number, because the mean of its divisors is an integer number (31809525).
Almost surely, 2126081281 is an apocalyptic number.
It is an amenable number.
126081281 is a deficient number, since it is larger than the sum of its proper divisors (1156819).
126081281 is a wasteful number, since it uses less digits than its factorization.
126081281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1156818.
The product of its (nonzero) digits is 1536, while the sum is 29.
The square root of 126081281 is about 11228.5921201191. The cubic root of 126081281 is about 501.4375708191.
The spelling of 126081281 in words is "one hundred twenty-six million, eighty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •