Base | Representation |
---|---|
bin | 1010000000111000010011… |
… | …1011101111110011001011 |
3 | 1102222120022221220101210211 |
4 | 2200032010323233303023 |
5 | 2420342423221400233 |
6 | 35230010330421551 |
7 | 2214314541014263 |
oct | 240160473576313 |
9 | 42876287811724 |
10 | 11010231434443 |
11 | 356545a67705a |
12 | 1299a342918b7 |
13 | 61b350053687 |
14 | 2a0c803407a3 |
15 | 141604a305cd |
hex | a0384eefccb |
11010231434443 has 32 divisors (see below), whose sum is σ = 11629864857600. Its totient is φ = 10403028066816.
The previous prime is 11010231434429. The next prime is 11010231434453. The reversal of 11010231434443 is 34443413201011.
It is a cyclic number.
It is not a de Polignac number, because 11010231434443 - 213 = 11010231426251 is a prime.
It is a super-2 number, since 2×110102314344432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11010231434453) 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 31 ways as a sum of consecutive naturals, for example, 1137533278 + ... + 1137542956.
It is an arithmetic number, because the mean of its divisors is an integer number (363433276800).
Almost surely, 211010231434443 is an apocalyptic number.
11010231434443 is a deficient number, since it is larger than the sum of its proper divisors (619633423157).
11010231434443 is a wasteful number, since it uses less digits than its factorization.
11010231434443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11251.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 11010231434443 its reverse (34443413201011), we get a palindrome (45453644635454).
The spelling of 11010231434443 in words is "eleven trillion, ten billion, two hundred thirty-one million, four hundred thirty-four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •