Base | Representation |
---|---|
bin | 1001101011100010101100… |
… | …1011010111111010011111 |
3 | 1101200112010111120211101021 |
4 | 2122320223023113322133 |
5 | 2343341200230030221 |
6 | 34345343222225011 |
7 | 2145656436552265 |
oct | 232705313277237 |
9 | 41615114524337 |
10 | 10643653361311 |
11 | 3433a47930023 |
12 | 123a989b85167 |
13 | 5c28cca0c729 |
14 | 28b226c60435 |
15 | 136cec39a041 |
hex | 9ae2b2d7e9f |
10643653361311 has 8 divisors (see below), whose sum is σ = 10829851943040. Its totient is φ = 10457648035608.
The previous prime is 10643653361309. The next prime is 10643653361347. The reversal of 10643653361311 is 11316335634601.
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 10643653361311 - 21 = 10643653361309 is a prime.
It is a super-2 number, since 2×106436533613112 (a number of 27 digits) contains 22 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 (10643653391311) 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, 48202891 + ... + 48423196.
It is an arithmetic number, because the mean of its divisors is an integer number (1353731492880).
Almost surely, 210643653361311 is an apocalyptic number.
10643653361311 is a deficient number, since it is larger than the sum of its proper divisors (186198581729).
10643653361311 is an equidigital number, since it uses as much as digits as its factorization.
10643653361311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96628013.
The product of its (nonzero) digits is 349920, while the sum is 43.
Adding to 10643653361311 its reverse (11316335634601), we get a palindrome (21959988995912).
The spelling of 10643653361311 in words is "ten trillion, six hundred forty-three billion, six hundred fifty-three million, three hundred sixty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •