Base | Representation |
---|---|
bin | 1010001101101011000101… |
… | …1011010010111011110111 |
3 | 1110202120122111012002100001 |
4 | 2203122301123102323313 |
5 | 2432443040414000143 |
6 | 35515000040532131 |
7 | 2236225252336165 |
oct | 243326133227367 |
9 | 43676574162301 |
10 | 11230021234423 |
11 | 363a697247952 |
12 | 1314553481047 |
13 | 635ca9331564 |
14 | 2ab77082c235 |
15 | 1471ba54e14d |
hex | a36b16d2ef7 |
11230021234423 has 32 divisors (see below), whose sum is σ = 12079991531520. Its totient is φ = 10414527298560.
The previous prime is 11230021234391. The next prime is 11230021234427. The reversal of 11230021234423 is 32443212003211.
It is not a de Polignac number, because 11230021234423 - 25 = 11230021234391 is a prime.
It is a super-2 number, since 2×112300212344232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11230021234391 and 11230021234400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11230021234427) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 849658311 + ... + 849671527.
It is an arithmetic number, because the mean of its divisors is an integer number (377499735360).
Almost surely, 211230021234423 is an apocalyptic number.
11230021234423 is a deficient number, since it is larger than the sum of its proper divisors (849970297097).
11230021234423 is a wasteful number, since it uses less digits than its factorization.
11230021234423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20607.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 11230021234423 its reverse (32443212003211), we get a palindrome (43673233237634).
The spelling of 11230021234423 in words is "eleven trillion, two hundred thirty billion, twenty-one million, two hundred thirty-four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •