Base | Representation |
---|---|
bin | 1010001101101011000110… |
… | …0010000010101110001111 |
3 | 1110202120122121111221101202 |
4 | 2203122301202002232033 |
5 | 2432443041342044043 |
6 | 35515000142500115 |
7 | 2236225303353356 |
oct | 243326142025617 |
9 | 43676577457352 |
10 | 11230023003023 |
11 | 363a698245700 |
12 | 1314553b9463b |
13 | 635ca9800576 |
14 | 2ab770b6c99d |
15 | 1471ba79d1b8 |
hex | a36b1882b8f |
11230023003023 has 12 divisors (see below), whose sum is σ = 12408371251584. Its totient is φ = 10155660952800.
The previous prime is 11230023003013. The next prime is 11230023003061. The reversal of 11230023003023 is 32030032003211.
It is not a de Polignac number, because 11230023003023 - 216 = 11230022937487 is a prime.
It is a super-2 number, since 2×112300230030232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11230023002986 and 11230023003004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11230023003013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 242935286 + ... + 242981507.
It is an arithmetic number, because the mean of its divisors is an integer number (1034030937632).
Almost surely, 211230023003023 is an apocalyptic number.
11230023003023 is a deficient number, since it is larger than the sum of its proper divisors (1178348248561).
11230023003023 is a wasteful number, since it uses less digits than its factorization.
11230023003023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485917006 (or 485916995 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 11230023003023 its reverse (32030032003211), we get a palindrome (43260055006234).
The spelling of 11230023003023 in words is "eleven trillion, two hundred thirty billion, twenty-three million, three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •