Base | Representation |
---|---|
bin | 111111101010010… |
… | …010000000100111 |
3 | 2202102201111000000 |
4 | 333222102000213 |
5 | 4141410022143 |
6 | 253551552343 |
7 | 35316155541 |
oct | 7752220047 |
9 | 2672644000 |
10 | 1068048423 |
11 | 4a8981652 |
12 | 25982b6b3 |
13 | 140374620 |
14 | a1bc2691 |
15 | 63b73bd3 |
hex | 3fa92027 |
1068048423 has 56 divisors (see below), whose sum is σ = 1735246800. Its totient is φ = 653184000.
The previous prime is 1068048419. The next prime is 1068048431. The reversal of 1068048423 is 3248408601.
1068048423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1068048423 - 22 = 1068048419 is a prime.
It is a super-2 number, since 2×10680484232 = 2281454867745573858, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1068048403) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 2378503 + ... + 2378951.
It is an arithmetic number, because the mean of its divisors is an integer number (30986550).
Almost surely, 21068048423 is an apocalyptic number.
1068048423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1068048423 is a deficient number, since it is larger than the sum of its proper divisors (667198377).
1068048423 is an equidigital number, since it uses as much as digits as its factorization.
1068048423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 731 (or 716 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 36.
The square root of 1068048423 is about 32681.0101282075. The cubic root of 1068048423 is about 1022.1869082034.
The spelling of 1068048423 in words is "one billion, sixty-eight million, forty-eight thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •