Base | Representation |
---|---|
bin | 1110100111001100011001… |
… | …01110011000011010000101 |
3 | 11012202212220210210021002220 |
4 | 13103212030232120122011 |
5 | 13202431401343411323 |
6 | 152201411314122553 |
7 | 6524350655361552 |
oct | 723461456303205 |
9 | 135685823707086 |
10 | 32133011310213 |
11 | a2695961a69a0 |
12 | 372b714580459 |
13 | 14c118c6bc6b8 |
14 | 7d1363213a29 |
15 | 3aacc01950e3 |
hex | 1d398cb98685 |
32133011310213 has 8 divisors (see below), whose sum is σ = 46738925542176. Its totient is φ = 19474552309200.
The previous prime is 32133011310193. The next prime is 32133011310259. The reversal of 32133011310213 is 31201311033123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32133011310213 - 26 = 32133011310149 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32133011810213) 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, 486863807698 + ... + 486863807763.
It is an arithmetic number, because the mean of its divisors is an integer number (5842365692772).
Almost surely, 232133011310213 is an apocalyptic number.
32133011310213 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
32133011310213 is a deficient number, since it is larger than the sum of its proper divisors (14605914231963).
32133011310213 is a wasteful number, since it uses less digits than its factorization.
32133011310213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 973727615475.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 32133011310213 its reverse (31201311033123), we get a palindrome (63334322343336).
The spelling of 32133011310213 in words is "thirty-two trillion, one hundred thirty-three billion, eleven million, three hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •