Base | Representation |
---|---|
bin | 1001101011100001010000… |
… | …0101111001111000101111 |
3 | 1101200111010111210110101022 |
4 | 2122320110011321320233 |
5 | 2343334402102123011 |
6 | 34345240545004355 |
7 | 2145644024513453 |
oct | 232702405717057 |
9 | 41614114713338 |
10 | 10643266051631 |
11 | 3433869242584 |
12 | 123a8a03236bb |
13 | 5c286a6c23c5 |
14 | 28b1cb640663 |
15 | 136cc83918db |
hex | 9ae14179e2f |
10643266051631 has 4 divisors (see below), whose sum is σ = 11106016749552. Its totient is φ = 10180515353712.
The previous prime is 10643266051603. The next prime is 10643266051673. The reversal of 10643266051631 is 13615066234601.
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 10643266051631 - 26 = 10643266051567 is a prime.
It is a super-2 number, since 2×106432660516312 (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 (10643266051031) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 231375348926 + ... + 231375348971.
It is an arithmetic number, because the mean of its divisors is an integer number (2776504187388).
Almost surely, 210643266051631 is an apocalyptic number.
10643266051631 is a deficient number, since it is larger than the sum of its proper divisors (462750697921).
10643266051631 is an equidigital number, since it uses as much as digits as its factorization.
10643266051631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462750697920.
The product of its (nonzero) digits is 466560, while the sum is 44.
The spelling of 10643266051631 in words is "ten trillion, six hundred forty-three billion, two hundred sixty-six million, fifty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •