Base | Representation |
---|---|
bin | 101110110111001010000… |
… | …001111001110011001111 |
3 | 102101212012122012222100201 |
4 | 232313022001321303033 |
5 | 410230203410014411 |
6 | 10503221121434331 |
7 | 451442350240144 |
oct | 56671201716317 |
9 | 12355178188321 |
10 | 3220320001231 |
11 | 1031803761623 |
12 | 44015279b9a7 |
13 | 1a48a0908638 |
14 | b1c1599c3cb |
15 | 58b7ba943c1 |
hex | 2edca079ccf |
3220320001231 has 24 divisors (see below), whose sum is σ = 3387354163200. Its totient is φ = 3061189436976.
The previous prime is 3220320001229. The next prime is 3220320001259. The reversal of 3220320001231 is 1321000230223.
It is not a de Polignac number, because 3220320001231 - 21 = 3220320001229 is a prime.
It is a super-2 number, since 2×32203200012312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3220320001199 and 3220320001208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3220320001331) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 90831150 + ... + 90866596.
It is an arithmetic number, because the mean of its divisors is an integer number (141139756800).
Almost surely, 23220320001231 is an apocalyptic number.
3220320001231 is a deficient number, since it is larger than the sum of its proper divisors (167034161969).
3220320001231 is a wasteful number, since it uses less digits than its factorization.
3220320001231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36555 (or 36532 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 3220320001231 its reverse (1321000230223), we get a palindrome (4541320231454).
The spelling of 3220320001231 in words is "three trillion, two hundred twenty billion, three hundred twenty million, one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •