Base | Representation |
---|---|
bin | 11110111100001011101… |
… | …10111111111110001001 |
3 | 10202122001110022012201011 |
4 | 33132011312333332021 |
5 | 114404213243202031 |
6 | 2132214352323521 |
7 | 136543450635310 |
oct | 17360566777611 |
9 | 3678043265634 |
10 | 1063102709641 |
11 | 37a94a8456a5 |
12 | 152052b435a1 |
13 | 7933378c19b |
14 | 39650ddb277 |
15 | 1c9c159a6b1 |
hex | f785dbff89 |
1063102709641 has 16 divisors (see below), whose sum is σ = 1240608006144. Its totient is φ = 892188013824.
The previous prime is 1063102709611. The next prime is 1063102709677. The reversal of 1063102709641 is 1469072013601.
It is a cyclic number.
It is not a de Polignac number, because 1063102709641 - 221 = 1063100612489 is a prime.
It is a super-2 number, since 2×10631027096412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1063102709594 and 1063102709603.
It is not an unprimeable number, because it can be changed into a prime (1063102709611) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7522825 + ... + 7662838.
It is an arithmetic number, because the mean of its divisors is an integer number (77538000384).
Almost surely, 21063102709641 is an apocalyptic number.
It is an amenable number.
1063102709641 is a deficient number, since it is larger than the sum of its proper divisors (177505296503).
1063102709641 is a wasteful number, since it uses less digits than its factorization.
1063102709641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15185880.
The product of its (nonzero) digits is 54432, while the sum is 40.
The spelling of 1063102709641 in words is "one trillion, sixty-three billion, one hundred two million, seven hundred nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •