Base | Representation |
---|---|
bin | 101000110001010… |
… | …1101001011011111 |
3 | 10112100020021011011 |
4 | 1101202231023133 |
5 | 10300210134242 |
6 | 343430040051 |
7 | 45621153046 |
oct | 12142551337 |
9 | 3470207134 |
10 | 1368052447 |
11 | 642259063 |
12 | 3221a9027 |
13 | 18a5741b8 |
14 | cd99755d |
15 | 80183d17 |
hex | 518ad2df |
1368052447 has 4 divisors (see below), whose sum is σ = 1368135496. Its totient is φ = 1367969400.
The previous prime is 1368052379. The next prime is 1368052451. The reversal of 1368052447 is 7442508631.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 7442508631 = 7537 ⋅987463.
It is a cyclic number.
It is not a de Polignac number, because 1368052447 - 211 = 1368050399 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1368052457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7548 + ... + 52849.
It is an arithmetic number, because the mean of its divisors is an integer number (342033874).
Almost surely, 21368052447 is an apocalyptic number.
1368052447 is a deficient number, since it is larger than the sum of its proper divisors (83049).
1368052447 is an equidigital number, since it uses as much as digits as its factorization.
1368052447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83048.
The product of its (nonzero) digits is 161280, while the sum is 40.
The square root of 1368052447 is about 36987.1930132580. The cubic root of 1368052447 is about 1110.1140069033.
The spelling of 1368052447 in words is "one billion, three hundred sixty-eight million, fifty-two thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •