Base | Representation |
---|---|
bin | 101110110010100000011… |
… | …100001110011001101101 |
3 | 102101101022200120000110120 |
4 | 232302200130032121231 |
5 | 410134442241302424 |
6 | 10501033450355153 |
7 | 451204544013462 |
oct | 56624034163155 |
9 | 12341280500416 |
10 | 3215327290989 |
11 | 102a681483510 |
12 | 43b19a72bab9 |
13 | 1a428642cb18 |
14 | b18a0877669 |
15 | 589885cca79 |
hex | 2eca070e66d |
3215327290989 has 32 divisors (see below), whose sum is σ = 4746991663104. Its totient is φ = 1919457492480.
The previous prime is 3215327290963. The next prime is 3215327291023. The reversal of 3215327290989 is 9890927235123.
3215327290989 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3215327290989 - 25 = 3215327290957 is a prime.
It is a super-3 number, since 3×32153272909893 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3215327290589) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35403612 + ... + 35494314.
It is an arithmetic number, because the mean of its divisors is an integer number (148343489472).
Almost surely, 23215327290989 is an apocalyptic number.
It is an amenable number.
3215327290989 is a deficient number, since it is larger than the sum of its proper divisors (1531664372115).
3215327290989 is a wasteful number, since it uses less digits than its factorization.
3215327290989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106817.
The product of its (nonzero) digits is 14696640, while the sum is 60.
The spelling of 3215327290989 in words is "three trillion, two hundred fifteen billion, three hundred twenty-seven million, two hundred ninety thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •