Base | Representation |
---|---|
bin | 110111111110111011… |
… | …1000111101101010010 |
3 | 102111022120011110021000 |
4 | 1233331313013231102 |
5 | 3432204114432010 |
6 | 131121344242430 |
7 | 11454146233323 |
oct | 1577567075522 |
9 | 374276143230 |
10 | 120223202130 |
11 | 46a93955199 |
12 | 1b372610416 |
13 | b44c506435 |
14 | 5b66c4844a |
15 | 31d98947c0 |
hex | 1bfddc7b52 |
120223202130 has 64 divisors (see below), whose sum is σ = 320748595200. Its totient is φ = 32044181760.
The previous prime is 120223202081. The next prime is 120223202131. The reversal of 120223202130 is 31202322021.
It is a super-3 number, since 3×1202232021303 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (120223202131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 464506 + ... + 675434.
It is an arithmetic number, because the mean of its divisors is an integer number (5011696800).
Almost surely, 2120223202130 is an apocalyptic number.
120223202130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120223202130 is an abundant number, since it is smaller than the sum of its proper divisors (200525393070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120223202130 is a wasteful number, since it uses less digits than its factorization.
120223202130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213056 (or 213050 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 120223202130 its reverse (31202322021), we get a palindrome (151425524151).
The spelling of 120223202130 in words is "one hundred twenty billion, two hundred twenty-three million, two hundred two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •