Base | Representation |
---|---|
bin | 1001011010101111110111… |
… | …0111101010011010100111 |
3 | 1100122221101211202022120002 |
4 | 2112223331313222122213 |
5 | 2324124301341120123 |
6 | 34005025314131515 |
7 | 2116063533131123 |
oct | 226537567523247 |
9 | 40587354668502 |
10 | 10355130410663 |
11 | 333264a182885 |
12 | 11b2a88280b9b |
13 | 5a163b8b60ac |
14 | 27b2960cc583 |
15 | 12e5625ad528 |
hex | 96afddea6a7 |
10355130410663 has 8 divisors (see below), whose sum is σ = 10359804137760. Its totient is φ = 10350457228800.
The previous prime is 10355130410587. The next prime is 10355130410671. The reversal of 10355130410663 is 36601403155301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10355130410663 - 232 = 10350835443367 is a prime.
It is a super-3 number, since 3×103551304106633 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10355130710663) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40575806 + ... + 40830212.
It is an arithmetic number, because the mean of its divisors is an integer number (1294975517220).
Almost surely, 210355130410663 is an apocalyptic number.
10355130410663 is a deficient number, since it is larger than the sum of its proper divisors (4673727097).
10355130410663 is a wasteful number, since it uses less digits than its factorization.
10355130410663 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272617.
The product of its (nonzero) digits is 97200, while the sum is 38.
Adding to 10355130410663 its reverse (36601403155301), we get a palindrome (46956533565964).
The spelling of 10355130410663 in words is "ten trillion, three hundred fifty-five billion, one hundred thirty million, four hundred ten thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •