Base | Representation |
---|---|
bin | 11101100110111111110101… |
… | …111101101000000011101011 |
3 | 122002002012221111111022200020 |
4 | 131212333311331220003223 |
5 | 114032034143421121303 |
6 | 1140543421450211523 |
7 | 36300214166443431 |
oct | 3546776575500353 |
9 | 562065844438606 |
10 | 130223240020203 |
11 | 385474030955a0 |
12 | 12732177723ba3 |
13 | 5787cca5c05b5 |
14 | 2422ba49aad51 |
15 | 100c612e3ea53 |
hex | 766ff5f680eb |
130223240020203 has 8 divisors (see below), whose sum is σ = 189415621847616. Its totient is φ = 78923175769800.
The previous prime is 130223240020129. The next prime is 130223240020261. The reversal of 130223240020203 is 302020042322031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130223240020203 - 210 = 130223240019179 is a prime.
It is a super-2 number, since 2×1302232400202032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130223240020703) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1973079394213 + ... + 1973079394278.
It is an arithmetic number, because the mean of its divisors is an integer number (23676952730952).
Almost surely, 2130223240020203 is an apocalyptic number.
130223240020203 is a deficient number, since it is larger than the sum of its proper divisors (59192381827413).
130223240020203 is a wasteful number, since it uses less digits than its factorization.
130223240020203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3946158788505.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 130223240020203 its reverse (302020042322031), we get a palindrome (432243282342234).
The spelling of 130223240020203 in words is "one hundred thirty trillion, two hundred twenty-three billion, two hundred forty million, twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •