Base | Representation |
---|---|
bin | 1010001101101011000110… |
… | …0011010000011000011011 |
3 | 1110202120122122010002201221 |
4 | 2203122301203100120123 |
5 | 2432443041432233430 |
6 | 35515000153352511 |
7 | 2236225306146634 |
oct | 243326143203033 |
9 | 43676578102657 |
10 | 11230023321115 |
11 | 363a698442695 |
12 | 1314554108737 |
13 | 635ca98b22a1 |
14 | 2ab770c1288b |
15 | 1471ba81257a |
hex | a36b18d061b |
11230023321115 has 8 divisors (see below), whose sum is σ = 13595284870848. Its totient is φ = 8904514066560.
The previous prime is 11230023321103. The next prime is 11230023321241. The reversal of 11230023321115 is 51112332003211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11230023321115 - 237 = 11092584367643 is a prime.
It is a super-2 number, since 2×112300233211152 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11230023321115.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9938073171 + ... + 9938074300.
It is an arithmetic number, because the mean of its divisors is an integer number (1699410608856).
Almost surely, 211230023321115 is an apocalyptic number.
11230023321115 is a deficient number, since it is larger than the sum of its proper divisors (2365261549733).
11230023321115 is a wasteful number, since it uses less digits than its factorization.
11230023321115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19876147589.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 11230023321115 its reverse (51112332003211), we get a palindrome (62342355324326).
The spelling of 11230023321115 in words is "eleven trillion, two hundred thirty billion, twenty-three million, three hundred twenty-one thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •