Base | Representation |
---|---|
bin | 1001011111010010000111… |
… | …0100101100000100010100 |
3 | 1100221101111201002001202112 |
4 | 2113310201310230010110 |
5 | 2331413333003201400 |
6 | 34104512423530152 |
7 | 2124522350322566 |
oct | 227644164540424 |
9 | 40841451061675 |
10 | 10433043022100 |
11 | 33626a0884a46 |
12 | 1205bb0bb9958 |
13 | 5a8aa742743a |
14 | 280d67941336 |
15 | 1315c26a6835 |
hex | 97d21d2c114 |
10433043022100 has 18 divisors (see below), whose sum is σ = 22639703358174. Its totient is φ = 4173217208800.
The previous prime is 10433043022091. The next prime is 10433043022169. The reversal of 10433043022100 is 122034033401.
It can be written as a sum of positive squares in 3 ways, for example, as 195065322244 + 10237977699856 = 441662^2 + 3199684^2 .
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 52165215011 + ... + 52165215210.
Almost surely, 210433043022100 is an apocalyptic number.
10433043022100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10433043022100 is an abundant number, since it is smaller than the sum of its proper divisors (12206660336074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10433043022100 is a wasteful number, since it uses less digits than its factorization.
10433043022100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104330430235 (or 104330430228 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 10433043022100 its reverse (122034033401), we get a palindrome (10555077055501).
The spelling of 10433043022100 in words is "ten trillion, four hundred thirty-three billion, forty-three million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •