Base | Representation |
---|---|
bin | 11101110101010111111110… |
… | …010001110111101101011000 |
3 | 122012120200002122221020021202 |
4 | 131311113332101313231120 |
5 | 114144231040314214000 |
6 | 1143021334145253332 |
7 | 36431461254060650 |
oct | 3565277621675530 |
9 | 565520078836252 |
10 | 131211222023000 |
11 | 38898404187299 |
12 | 12871744934248 |
13 | 582a21ba92992 |
14 | 245892ac6d360 |
15 | 102818957cdd5 |
hex | 7755fe477b58 |
131211222023000 has 64 divisors (see below), whose sum is σ = 350896296628800. Its totient is φ = 44986704691200.
The previous prime is 131211222022999. The next prime is 131211222023047. The reversal of 131211222023000 is 320222112131.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9372223145 + ... + 9372237144.
It is an arithmetic number, because the mean of its divisors is an integer number (5482754634825).
Almost surely, 2131211222023000 is an apocalyptic number.
131211222023000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131211222023000 is an abundant number, since it is smaller than the sum of its proper divisors (219685074605800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131211222023000 is a wasteful number, since it uses less digits than its factorization.
131211222023000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18744460317 (or 18744460303 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 131211222023000 its reverse (320222112131), we get a palindrome (131531444135131).
The spelling of 131211222023000 in words is "one hundred thirty-one trillion, two hundred eleven billion, two hundred twenty-two million, twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •