Base | Representation |
---|---|
bin | 1111000001110… |
… | …10100001101111 |
3 | 22210012221221120 |
4 | 13200322201233 |
5 | 224233200342 |
6 | 20302032023 |
7 | 3060365442 |
oct | 740724157 |
9 | 283187846 |
10 | 126068847 |
11 | 65187433 |
12 | 36278613 |
13 | 20170368 |
14 | 12a59659 |
15 | b103aec |
hex | 783a86f |
126068847 has 8 divisors (see below), whose sum is σ = 173514240. Its totient is φ = 81334680.
The previous prime is 126068837. The next prime is 126068849. The reversal of 126068847 is 748860621.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 126068847 - 212 = 126064751 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 126068799 and 126068808.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126068849) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 677697 + ... + 677882.
It is an arithmetic number, because the mean of its divisors is an integer number (21689280).
Almost surely, 2126068847 is an apocalyptic number.
126068847 is a deficient number, since it is larger than the sum of its proper divisors (47445393).
126068847 is a wasteful number, since it uses less digits than its factorization.
126068847 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1355613.
The product of its (nonzero) digits is 129024, while the sum is 42.
The square root of 126068847 is about 11228.0384306432. The cubic root of 126068847 is about 501.4210865330.
It can be divided in two parts, 1260 and 68847, that added together give a palindrome (70107).
The spelling of 126068847 in words is "one hundred twenty-six million, sixty-eight thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •