Base | Representation |
---|---|
bin | 11110111100100101001… |
… | …10010001010010000011 |
3 | 10202122121100110020001111 |
4 | 33132102212101102003 |
5 | 114410133001143112 |
6 | 2132251505144151 |
7 | 136551654336526 |
oct | 17362246212203 |
9 | 3678540406044 |
10 | 1063316427907 |
11 | 37aa4a448368 |
12 | 1520b262b057 |
13 | 79368b3a5b6 |
14 | 39671550bbd |
15 | 1c9d52145a7 |
hex | f792991483 |
1063316427907 has 16 divisors (see below), whose sum is σ = 1150437302784. Its totient is φ = 979141072000.
The previous prime is 1063316427881. The next prime is 1063316427917. The reversal of 1063316427907 is 7097246133601.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1063316427907 - 235 = 1028956689539 is a prime.
It is a super-2 number, since 2×10633164279072 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1063316427917) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3204319 + ... + 3520552.
It is an arithmetic number, because the mean of its divisors is an integer number (71902331424).
Almost surely, 21063316427907 is an apocalyptic number.
1063316427907 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
1063316427907 is a deficient number, since it is larger than the sum of its proper divisors (87120874877).
1063316427907 is a wasteful number, since it uses less digits than its factorization.
1063316427907 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6725090.
The product of its (nonzero) digits is 1143072, while the sum is 49.
The spelling of 1063316427907 in words is "one trillion, sixty-three billion, three hundred sixteen million, four hundred twenty-seven thousand, nine hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •