Base | Representation |
---|---|
bin | 101110111000001011010… |
… | …000010111010011101001 |
3 | 102101222000220100200100112 |
4 | 232320023100113103221 |
5 | 410234424030424040 |
6 | 10503521452344105 |
7 | 451511435564102 |
oct | 56701320272351 |
9 | 12358026320315 |
10 | 3221414311145 |
11 | 103221543a888 |
12 | 4403b9175035 |
13 | 1a4a165463b4 |
14 | b1cbb0593a9 |
15 | 58be2ba4365 |
hex | 2ee0b4174e9 |
3221414311145 has 8 divisors (see below), whose sum is σ = 3869903595840. Its totient is φ = 2574327167280.
The previous prime is 3221414311079. The next prime is 3221414311153. The reversal of 3221414311145 is 5411134141223.
3221414311145 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3221414311145 - 236 = 3152694834409 is a prime.
It is a super-2 number, since 2×32214143111452 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 350530151 + ... + 350539340.
It is an arithmetic number, because the mean of its divisors is an integer number (483737949480).
Almost surely, 23221414311145 is an apocalyptic number.
It is an amenable number.
3221414311145 is a deficient number, since it is larger than the sum of its proper divisors (648489284695).
3221414311145 is an equidigital number, since it uses as much as digits as its factorization.
3221414311145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701070415.
The product of its digits is 11520, while the sum is 32.
Adding to 3221414311145 its reverse (5411134141223), we get a palindrome (8632548452368).
The spelling of 3221414311145 in words is "three trillion, two hundred twenty-one billion, four hundred fourteen million, three hundred eleven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •