Base | Representation |
---|---|
bin | 1010010100001100110000… |
… | …1111101000001011001111 |
3 | 1111011022001021000021020000 |
4 | 2211003030033220023033 |
5 | 2441312200404411343 |
6 | 40042301325455343 |
7 | 2250304544633202 |
oct | 245031417501317 |
9 | 44138037007200 |
10 | 11342140310223 |
11 | 36831a1574a78 |
12 | 1332223a11553 |
13 | 643736867b68 |
14 | 2b2d69225939 |
15 | 14a07d6caed3 |
hex | a50cc3e82cf |
11342140310223 has 20 divisors (see below), whose sum is σ = 16943287826520. Its totient is φ = 7561386452592.
The previous prime is 11342140310219. The next prime is 11342140310231. The reversal of 11342140310223 is 32201304124311.
11342140310223 is a `hidden beast` number, since 1 + 1 + 3 + 4 + 21 + 403 + 10 + 223 = 666.
It is not a de Polignac number, because 11342140310223 - 22 = 11342140310219 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11342140310203) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 29551636 + ... + 29932982.
It is an arithmetic number, because the mean of its divisors is an integer number (847164391326).
Almost surely, 211342140310223 is an apocalyptic number.
11342140310223 is a deficient number, since it is larger than the sum of its proper divisors (5601147516297).
11342140310223 is an equidigital number, since it uses as much as digits as its factorization.
11342140310223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 748548 (or 748539 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 11342140310223 its reverse (32201304124311), we get a palindrome (43543444434534).
The spelling of 11342140310223 in words is "eleven trillion, three hundred forty-two billion, one hundred forty million, three hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •