Base | Representation |
---|---|
bin | 101111001001100000010… |
… | …111001001101111011101 |
3 | 102110202001201001101111121 |
4 | 233021200113021233131 |
5 | 411041031114220013 |
6 | 10520240124250541 |
7 | 453040523535220 |
oct | 57114027115735 |
9 | 12422051041447 |
10 | 3240022023133 |
11 | 103a0a3a68255 |
12 | 443b309a0a51 |
13 | 1a66c064286c |
14 | b2b644795b7 |
15 | 594315a058d |
hex | 2f2605c9bdd |
3240022023133 has 32 divisors (see below), whose sum is σ = 3746765797632. Its totient is φ = 2744449344000.
The previous prime is 3240022023109. The next prime is 3240022023143. The reversal of 3240022023133 is 3313202200423.
It is not a de Polignac number, because 3240022023133 - 221 = 3240019925981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3240022023098 and 3240022023107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3240022023143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 239763985 + ... + 239777497.
It is an arithmetic number, because the mean of its divisors is an integer number (117086431176).
Almost surely, 23240022023133 is an apocalyptic number.
It is an amenable number.
3240022023133 is a deficient number, since it is larger than the sum of its proper divisors (506743774499).
3240022023133 is a wasteful number, since it uses less digits than its factorization.
3240022023133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14725.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 3240022023133 its reverse (3313202200423), we get a palindrome (6553224223556).
The spelling of 3240022023133 in words is "three trillion, two hundred forty billion, twenty-two million, twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •