Base | Representation |
---|---|
bin | 111110111101010… |
… | …001001000010010 |
3 | 2201121111222022211 |
4 | 332331101020102 |
5 | 4130344421323 |
6 | 252451022334 |
7 | 35113651135 |
oct | 7675211022 |
9 | 2647458284 |
10 | 1056248338 |
11 | 4a2252012 |
12 | 25589a9aa |
13 | 13aaa2622 |
14 | a03d021c |
15 | 62ae270d |
hex | 3ef51212 |
1056248338 has 4 divisors (see below), whose sum is σ = 1584372510. Its totient is φ = 528124168.
The previous prime is 1056248321. The next prime is 1056248341. The reversal of 1056248338 is 8338426501.
1056248338 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 786073369 + 270174969 = 28037^2 + 16437^2 .
It is a super-2 number, since 2×10562483382 = 2231321103055524488, which contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 1056248338.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 264062083 + ... + 264062086.
Almost surely, 21056248338 is an apocalyptic number.
1056248338 is a deficient number, since it is larger than the sum of its proper divisors (528124172).
1056248338 is an equidigital number, since it uses as much as digits as its factorization.
1056248338 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528124171.
The product of its (nonzero) digits is 138240, while the sum is 40.
The square root of 1056248338 is about 32499.9744307592. The cubic root of 1056248338 is about 1018.4084939713.
The spelling of 1056248338 in words is "one billion, fifty-six million, two hundred forty-eight thousand, three hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.367 sec. • engine limits •