Base | Representation |
---|---|
bin | 1110100111000111000000… |
… | …11101111010001110011101 |
3 | 11012202121110101202002122221 |
4 | 13103203200131322032131 |
5 | 13202404442023424013 |
6 | 152200212435305341 |
7 | 6524216233653346 |
oct | 723434035721635 |
9 | 135677411662587 |
10 | 32130121311133 |
11 | a2683429388aa |
12 | 372b04874b251 |
13 | 14c0b1ba40a81 |
14 | 7d116b4830cd |
15 | 3aaba15ce08d |
hex | 1d38e077a39d |
32130121311133 has 16 divisors (see below), whose sum is σ = 34049631035520. Its totient is φ = 30213899606016.
The previous prime is 32130121311131. The next prime is 32130121311137. The reversal of 32130121311133 is 33111312103123.
It is a cyclic number.
It is not a de Polignac number, because 32130121311133 - 21 = 32130121311131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32130121311098 and 32130121311107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32130121311131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 104944048 + ... + 105249766.
It is an arithmetic number, because the mean of its divisors is an integer number (2128101939720).
Almost surely, 232130121311133 is an apocalyptic number.
It is an amenable number.
32130121311133 is a deficient number, since it is larger than the sum of its proper divisors (1919509724387).
32130121311133 is a wasteful number, since it uses less digits than its factorization.
32130121311133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311076.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 32130121311133 its reverse (33111312103123), we get a palindrome (65241433414256).
The spelling of 32130121311133 in words is "thirty-two trillion, one hundred thirty billion, one hundred twenty-one million, three hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •