Base | Representation |
---|---|
bin | 101111101010011000000… |
… | …011110101100010011100 |
3 | 102121010011102022110120020 |
4 | 233222120003311202130 |
5 | 412130321423101413 |
6 | 10544354241352140 |
7 | 455430250350420 |
oct | 57523003654234 |
9 | 12533142273506 |
10 | 3275316222108 |
11 | 1053065690337 |
12 | 44a940938650 |
13 | 1a9b267b2a78 |
14 | b4751a88b80 |
15 | 5a2e9d95c23 |
hex | 2fa980f589c |
3275316222108 has 96 divisors (see below), whose sum is σ = 9309197011968. Its totient is φ = 874924416000.
The previous prime is 3275316222047. The next prime is 3275316222131. The reversal of 3275316222108 is 8012226135723.
3275316222108 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 3275316222108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7379203 + ... + 7810458.
It is an arithmetic number, because the mean of its divisors is an integer number (96970802208).
Almost surely, 23275316222108 is an apocalyptic number.
It is an amenable number.
3275316222108 is an abundant number, since it is smaller than the sum of its proper divisors (6033880789860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3275316222108 is a wasteful number, since it uses less digits than its factorization.
3275316222108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15189843 (or 15189841 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 42.
The spelling of 3275316222108 in words is "three trillion, two hundred seventy-five billion, three hundred sixteen million, two hundred twenty-two thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •