Base | Representation |
---|---|
bin | 101110110111110011010… |
… | …101111010010011011111 |
3 | 102101220222221102122122002 |
4 | 232313303111322103133 |
5 | 410233113324041111 |
6 | 10503414001312515 |
7 | 451465464466301 |
oct | 56676325722337 |
9 | 12356887378562 |
10 | 3221013112031 |
11 | 1032029a25a70 |
12 | 44030693573b |
13 | 1a49813a5080 |
14 | b1c7da61971 |
15 | 58bbc85563b |
hex | 2edf357a4df |
3221013112031 has 64 divisors (see below), whose sum is σ = 3927893630976. Its totient is φ = 2602476864000.
The previous prime is 3221013112007. The next prime is 3221013112069. The reversal of 3221013112031 is 1302113101223.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-3221013112031 is a prime.
It is a super-2 number, since 2×32210131120312 (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 = 3221013111994 and 3221013112012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3221013112931) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 106559786 + ... + 106590008.
It is an arithmetic number, because the mean of its divisors is an integer number (61373337984).
Almost surely, 23221013112031 is an apocalyptic number.
3221013112031 is a deficient number, since it is larger than the sum of its proper divisors (706880518945).
3221013112031 is a wasteful number, since it uses less digits than its factorization.
3221013112031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30552.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 3221013112031 its reverse (1302113101223), we get a palindrome (4523126213254).
The spelling of 3221013112031 in words is "three trillion, two hundred twenty-one billion, thirteen million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •