Base | Representation |
---|---|
bin | 11101110101100010000111… |
… | …110111100101000011001110 |
3 | 122012121201020012000010220221 |
4 | 131311202013313211003032 |
5 | 114144420400300234410 |
6 | 1143030335421501554 |
7 | 36432325320063121 |
oct | 3565420767450316 |
9 | 565551205003827 |
10 | 131222120321230 |
11 | 388a1a96a71034 |
12 | 128738867118ba |
13 | 582b2678cc063 |
14 | 24592824283b8 |
15 | 10285c622d4da |
hex | 775887de50ce |
131222120321230 has 64 divisors (see below), whose sum is σ = 257139143412480. Its totient is φ = 48018512793600.
The previous prime is 131222120321221. The next prime is 131222120321269. The reversal of 131222120321230 is 32123021222131.
It is a junction number, because it is equal to n+sod(n) for n = 131222120321195 and 131222120321204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32846745 + ... + 36624484.
It is an arithmetic number, because the mean of its divisors is an integer number (4017799115820).
Almost surely, 2131222120321230 is an apocalyptic number.
131222120321230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131222120321230 is a deficient number, since it is larger than the sum of its proper divisors (125917023091250).
131222120321230 is a wasteful number, since it uses less digits than its factorization.
131222120321230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69471565.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 131222120321230 its reverse (32123021222131), we get a palindrome (163345141543361).
Subtracting from 131222120321230 its reverse (32123021222131), we obtain a palindrome (99099099099099).
The spelling of 131222120321230 in words is "one hundred thirty-one trillion, two hundred twenty-two billion, one hundred twenty million, three hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •