Base | Representation |
---|---|
bin | 1010000000000100111010… |
… | …1010000000110111110111 |
3 | 1102221020201112012100202210 |
4 | 2200001032222000313313 |
5 | 2420131200043223411 |
6 | 35215405400504503 |
7 | 2213315635021605 |
oct | 240011652006767 |
9 | 42836645170683 |
10 | 10996435914231 |
11 | 355a620440589 |
12 | 129722417b133 |
13 | 619c61c09b71 |
14 | 2a0332094875 |
15 | 14109883dca6 |
hex | a004ea80df7 |
10996435914231 has 4 divisors (see below), whose sum is σ = 14661914552312. Its totient is φ = 7330957276152.
The previous prime is 10996435914227. The next prime is 10996435914281. The reversal of 10996435914231 is 13241953469901.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10996435914231 - 22 = 10996435914227 is a prime.
It is a super-2 number, since 2×109964359142312 (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 (10996435914281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1832739319036 + ... + 1832739319041.
It is an arithmetic number, because the mean of its divisors is an integer number (3665478638078).
Almost surely, 210996435914231 is an apocalyptic number.
10996435914231 is a deficient number, since it is larger than the sum of its proper divisors (3665478638081).
10996435914231 is an equidigital number, since it uses as much as digits as its factorization.
10996435914231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3665478638080.
The product of its (nonzero) digits is 6298560, while the sum is 57.
The spelling of 10996435914231 in words is "ten trillion, nine hundred ninety-six billion, four hundred thirty-five million, nine hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •