Base | Representation |
---|---|
bin | 101110110111000100110… |
… | …110000110011001011110 |
3 | 102101211222120112220221111 |
4 | 232313010312012121132 |
5 | 410230014123133042 |
6 | 10503204333252234 |
7 | 451440243022423 |
oct | 56670466063136 |
9 | 12354876486844 |
10 | 3220233021022 |
11 | 1031769653056 |
12 | 44012963407a |
13 | 1a48888a3064 |
14 | b1c081d9d4a |
15 | 58b74112517 |
hex | 2edc4d8665e |
3220233021022 has 8 divisors (see below), whose sum is σ = 4830455183400. Its totient is φ = 1610081293224.
The previous prime is 3220233021017. The next prime is 3220233021029. The reversal of 3220233021022 is 2201203320223.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×32202330210223 (a number of 39 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3220233020984 and 3220233021002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3220233021029) 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 3 ways as a sum of consecutive naturals, for example, 17494197 + ... + 17677312.
It is an arithmetic number, because the mean of its divisors is an integer number (603806897925).
Almost surely, 23220233021022 is an apocalyptic number.
3220233021022 is a deficient number, since it is larger than the sum of its proper divisors (1610222162378).
3220233021022 is a wasteful number, since it uses less digits than its factorization.
3220233021022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35217290.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 3220233021022 its reverse (2201203320223), we get a palindrome (5421436341245).
The spelling of 3220233021022 in words is "three trillion, two hundred twenty billion, two hundred thirty-three million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •