Base | Representation |
---|---|
bin | 111111101101101… |
… | …101011101111011 |
3 | 2202111102011001121 |
4 | 333231231131323 |
5 | 4142122303243 |
6 | 254023130111 |
7 | 35326621333 |
oct | 7755553573 |
9 | 2674364047 |
10 | 1068947323 |
11 | 4a9435a44 |
12 | 259ba3937 |
13 | 1405ca812 |
14 | a1d780c3 |
15 | 63ca01ed |
hex | 3fb6d77b |
1068947323 has 4 divisors (see below), whose sum is σ = 1072751688. Its totient is φ = 1065142960.
The previous prime is 1068947281. The next prime is 1068947339. The reversal of 1068947323 is 3237498601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1068947323 - 217 = 1068816251 is a prime.
It is a super-2 number, since 2×10689473232 = 2285296758697732658, which contains 22 as substring.
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 1068947323.
It is not an unprimeable number, because it can be changed into a prime (1068947023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1901761 + ... + 1902322.
It is an arithmetic number, because the mean of its divisors is an integer number (268187922).
Almost surely, 21068947323 is an apocalyptic number.
1068947323 is a deficient number, since it is larger than the sum of its proper divisors (3804365).
1068947323 is an equidigital number, since it uses as much as digits as its factorization.
1068947323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3804364.
The product of its (nonzero) digits is 217728, while the sum is 43.
The square root of 1068947323 is about 32694.7598706582. The cubic root of 1068947323 is about 1022.4735950044.
The spelling of 1068947323 in words is "one billion, sixty-eight million, nine hundred forty-seven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •