Base | Representation |
---|---|
bin | 11101100110111111110100… |
… | …111100101111001110011000 |
3 | 122002002012220022111010100010 |
4 | 131212333310330233032120 |
5 | 114032034130042311300 |
6 | 1140543420041441520 |
7 | 36300213602036535 |
oct | 3546776474571630 |
9 | 562065808433303 |
10 | 130223223010200 |
11 | 385473a4527741 |
12 | 12732171aa02a0 |
13 | 5787cc6c160c8 |
14 | 2422ba261dd8c |
15 | 100c6116cea50 |
hex | 766ff4f2f398 |
130223223010200 has 48 divisors (see below), whose sum is σ = 403691991333480. Its totient is φ = 34726192802560.
The previous prime is 130223223010151. The next prime is 130223223010247. The reversal of 130223223010200 is 2010322322031.
It is a happy number.
It is a super-3 number, since 3×1302232230102003 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 108519351909 + ... + 108519353108.
Almost surely, 2130223223010200 is an apocalyptic number.
130223223010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130223223010200 is an abundant number, since it is smaller than the sum of its proper divisors (273468768323280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130223223010200 is a wasteful number, since it uses less digits than its factorization.
130223223010200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 217038705036 (or 217038705027 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 130223223010200 its reverse (2010322322031), we get a palindrome (132233545332231).
The spelling of 130223223010200 in words is "one hundred thirty trillion, two hundred twenty-three billion, two hundred twenty-three million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •