Base | Representation |
---|---|
bin | 100000011101110010101… |
… | …000011010011001011010 |
3 | 21220021122000012220012010 |
4 | 200131302220122121122 |
5 | 243023102333120010 |
6 | 4424525025130350 |
7 | 320120352334224 |
oct | 40356250323132 |
9 | 7807560186163 |
10 | 2231011223130 |
11 | 790191744a08 |
12 | 3004751899b6 |
13 | 1324ca5b5001 |
14 | 79da5409414 |
15 | 3d078c27620 |
hex | 20772a1a65a |
2231011223130 has 16 divisors (see below), whose sum is σ = 5354426935584. Its totient is φ = 594936326160.
The previous prime is 2231011223107. The next prime is 2231011223197. The reversal of 2231011223130 is 313221101322.
It is a super-3 number, since 3×22310112231303 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 2231011223097 and 2231011223106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37183520356 + ... + 37183520415.
It is an arithmetic number, because the mean of its divisors is an integer number (334651683474).
Almost surely, 22231011223130 is an apocalyptic number.
2231011223130 is an abundant number, since it is smaller than the sum of its proper divisors (3123415712454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2231011223130 is a wasteful number, since it uses less digits than its factorization.
2231011223130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74367040781.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2231011223130 its reverse (313221101322), we get a palindrome (2544232324452).
The spelling of 2231011223130 in words is "two trillion, two hundred thirty-one billion, eleven million, two hundred twenty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •