Base | Representation |
---|---|
bin | 1011111100011000111101… |
… | …0111001000110011010010 |
3 | 1201111102022001000200012220 |
4 | 2333012033113020303102 |
5 | 3210124040234343442 |
6 | 43532451315401510 |
7 | 2523523116133524 |
oct | 277061727106322 |
9 | 51442261020186 |
10 | 13132120231122 |
11 | 4203334575952 |
12 | 15811145b3296 |
13 | 743479bb2479 |
14 | 335852d25a14 |
15 | 17b8e370beec |
hex | bf18f5c8cd2 |
13132120231122 has 16 divisors (see below), whose sum is σ = 26505196798080. Its totient is φ = 4337214021072.
The previous prime is 13132120231121. The next prime is 13132120231123. The reversal of 13132120231122 is 22113202123131.
It is an interprime number because it is at equal distance from previous prime (13132120231121) and next prime (13132120231123).
It is a junction number, because it is equal to n+sod(n) for n = 13132120231092 and 13132120231101.
It is not an unprimeable number, because it can be changed into a prime (13132120231121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10039846618 + ... + 10039847925.
It is an arithmetic number, because the mean of its divisors is an integer number (1656574799880).
Almost surely, 213132120231122 is an apocalyptic number.
13132120231122 is an abundant number, since it is smaller than the sum of its proper divisors (13373076566958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13132120231122 is a wasteful number, since it uses less digits than its factorization.
13132120231122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20079694657.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 13132120231122 its reverse (22113202123131), we get a palindrome (35245322354253).
The spelling of 13132120231122 in words is "thirteen trillion, one hundred thirty-two billion, one hundred twenty million, two hundred thirty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •