Base | Representation |
---|---|
bin | 101110111001110001110… |
… | …000100011001000001001 |
3 | 102102010110202022011011200 |
4 | 232321301300203020021 |
5 | 410301434302233301 |
6 | 10504404244014413 |
7 | 451602160111560 |
oct | 56716160431011 |
9 | 12363422264150 |
10 | 3223134024201 |
11 | 1032a18147743 |
12 | 4407b9091409 |
13 | 1a4c2b9055a0 |
14 | b20015d2bd7 |
15 | 58c93b4dc86 |
hex | 2ee71c23209 |
3223134024201 has 48 divisors (see below), whose sum is σ = 5730227892480. Its totient is φ = 1700051794560.
The previous prime is 3223134024181. The next prime is 3223134024247. The reversal of 3223134024201 is 1024204313223.
3223134024201 is a `hidden beast` number, since 3 + 2 + 231 + 3 + 4 + 0 + 2 + 420 + 1 = 666.
It is not a de Polignac number, because 3223134024201 - 213 = 3223134016009 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3223134024281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 29356315 + ... + 29465903.
It is an arithmetic number, because the mean of its divisors is an integer number (119379747760).
Almost surely, 23223134024201 is an apocalyptic number.
It is an amenable number.
3223134024201 is a deficient number, since it is larger than the sum of its proper divisors (2507093868279).
3223134024201 is a wasteful number, since it uses less digits than its factorization.
3223134024201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145526 (or 145523 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 3223134024201 its reverse (1024204313223), we get a palindrome (4247338337424).
The spelling of 3223134024201 in words is "three trillion, two hundred twenty-three billion, one hundred thirty-four million, twenty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •