Base | Representation |
---|---|
bin | 1001101011011110110110… |
… | …1010111011000010010011 |
3 | 1101200102110120212000021121 |
4 | 2122313231222323002103 |
5 | 2343332042042203433 |
6 | 34345053000503111 |
7 | 2145622036446565 |
oct | 232675552730223 |
9 | 41612416760247 |
10 | 10642621444243 |
11 | 34335683974a8 |
12 | 123a74047aa97 |
13 | 5c2796ca8b09 |
14 | 28b169ba5335 |
15 | 136c8b9b1c2d |
hex | 9adedabb093 |
10642621444243 has 4 divisors (see below), whose sum is σ = 10644490872288. Its totient is φ = 10640752016200.
The previous prime is 10642621444223. The next prime is 10642621444283. The reversal of 10642621444243 is 34244412624601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10642621444243 is a prime.
It is a super-2 number, since 2×106426214442432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10642621444243.
It is not an unprimeable number, because it can be changed into a prime (10642621444223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 934705483 + ... + 934716868.
It is an arithmetic number, because the mean of its divisors is an integer number (2661122718072).
Almost surely, 210642621444243 is an apocalyptic number.
10642621444243 is a deficient number, since it is larger than the sum of its proper divisors (1869428045).
10642621444243 is an equidigital number, since it uses as much as digits as its factorization.
10642621444243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1869428044.
The product of its (nonzero) digits is 884736, while the sum is 43.
The spelling of 10642621444243 in words is "ten trillion, six hundred forty-two billion, six hundred twenty-one million, four hundred forty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •