Base | Representation |
---|---|
bin | 11110111101101111010… |
… | …10111011000000011111 |
3 | 10202201012200210220101021 |
4 | 33132313222323000133 |
5 | 114412421212420013 |
6 | 2132433324225011 |
7 | 136603246136161 |
oct | 17366752730037 |
9 | 3681180726337 |
10 | 1063938404383 |
11 | 380239546508 |
12 | 15224699b167 |
13 | 7943795c10a |
14 | 396cddb8931 |
15 | 1ca1eb23a8d |
hex | f7b7abb01f |
1063938404383 has 4 divisors (see below), whose sum is σ = 1070309293200. Its totient is φ = 1057567515568.
The previous prime is 1063938404371. The next prime is 1063938404387. The reversal of 1063938404383 is 3834048393601.
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 1063938404383 - 217 = 1063938273311 is a prime.
It is a super-2 number, since 2×10639384043832 (a number of 25 digits) 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 1063938404383.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1063938404387) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3185444158 + ... + 3185444491.
It is an arithmetic number, because the mean of its divisors is an integer number (267577323300).
Almost surely, 21063938404383 is an apocalyptic number.
1063938404383 is a deficient number, since it is larger than the sum of its proper divisors (6370888817).
1063938404383 is an equidigital number, since it uses as much as digits as its factorization.
1063938404383 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6370888816.
The product of its (nonzero) digits is 4478976, while the sum is 52.
The spelling of 1063938404383 in words is "one trillion, sixty-three billion, nine hundred thirty-eight million, four hundred four thousand, three hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •