Base | Representation |
---|---|
bin | 1001101011100000101001… |
… | …0101110100111001011111 |
3 | 1101200110201002221210201110 |
4 | 2122320022111310321133 |
5 | 2343334033212001333 |
6 | 34345212422313103 |
7 | 2145640000116513 |
oct | 232701225647137 |
9 | 41613632853643 |
10 | 10643102453343 |
11 | 3433794962788 |
12 | 123a855588793 |
13 | 5c2842841b99 |
14 | 28b1b3a16143 |
15 | 136cb8d28063 |
hex | 9ae0a574e5f |
10643102453343 has 8 divisors (see below), whose sum is σ = 14492735255808. Its totient is φ = 6944435643224.
The previous prime is 10643102453329. The next prime is 10643102453351. The reversal of 10643102453343 is 34335420134601.
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 10643102453343 - 26 = 10643102453279 is a prime.
It is a super-2 number, since 2×106431024533432 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10643102453363) 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, 37741497921 + ... + 37741498202.
It is an arithmetic number, because the mean of its divisors is an integer number (1811591906976).
Almost surely, 210643102453343 is an apocalyptic number.
10643102453343 is a deficient number, since it is larger than the sum of its proper divisors (3849632802465).
10643102453343 is an equidigital number, since it uses as much as digits as its factorization.
10643102453343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75482996173.
The product of its (nonzero) digits is 311040, while the sum is 39.
Adding to 10643102453343 its reverse (34335420134601), we get a palindrome (44978522587944).
The spelling of 10643102453343 in words is "ten trillion, six hundred forty-three billion, one hundred two million, four hundred fifty-three thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •