Base | Representation |
---|---|
bin | 1001101011100000101110… |
… | …1101100001001110011011 |
3 | 1101200110202201012201110021 |
4 | 2122320023231201032123 |
5 | 2343334110103111220 |
6 | 34345215003131311 |
7 | 2145640366402264 |
oct | 232701355411633 |
9 | 41613681181407 |
10 | 10643125441435 |
11 | 34337a6934003 |
12 | 123a861213b37 |
13 | 5c28475303c6 |
14 | 28b1b6abb96b |
15 | 136cbad694aa |
hex | 9ae0bb6139b |
10643125441435 has 8 divisors (see below), whose sum is σ = 12771810687456. Its totient is φ = 8514460248000.
The previous prime is 10643125441427. The next prime is 10643125441447. The reversal of 10643125441435 is 53414452134601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10643125441435 - 23 = 10643125441427 is a prime.
It is a super-2 number, since 2×106431254414352 (a number of 27 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 = 10643125441391 and 10643125441400.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3819639 + ... + 5989648.
It is an arithmetic number, because the mean of its divisors is an integer number (1596476335932).
Almost surely, 210643125441435 is an apocalyptic number.
10643125441435 is a deficient number, since it is larger than the sum of its proper divisors (2128685246021).
10643125441435 is an equidigital number, since it uses as much as digits as its factorization.
10643125441435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10026293.
The product of its (nonzero) digits is 691200, while the sum is 43.
The spelling of 10643125441435 in words is "ten trillion, six hundred forty-three billion, one hundred twenty-five million, four hundred forty-one thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •