Base | Representation |
---|---|
bin | 101110110000101011010… |
… | …100000110101011010101 |
3 | 102101012020201221110201002 |
4 | 232300223110012223111 |
5 | 410121431212243200 |
6 | 10500110452313045 |
7 | 451105053161603 |
oct | 56605324065325 |
9 | 12335221843632 |
10 | 3213362227925 |
11 | 1029863229553 |
12 | 43a930612785 |
13 | 1a4032298905 |
14 | b17558b4873 |
15 | 588c0d1bbd5 |
hex | 2ec2b506ad5 |
3213362227925 has 24 divisors (see below), whose sum is σ = 4290463339200. Its totient is φ = 2378464705280.
The previous prime is 3213362227919. The next prime is 3213362227927. The reversal of 3213362227925 is 5297222633123.
It is a happy number.
3213362227925 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 3213362227925 - 26 = 3213362227861 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3213362227925.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3213362227927) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 64049945 + ... + 64100094.
It is an arithmetic number, because the mean of its divisors is an integer number (178769305800).
Almost surely, 23213362227925 is an apocalyptic number.
It is an amenable number.
3213362227925 is a deficient number, since it is larger than the sum of its proper divisors (1077101111275).
3213362227925 is a wasteful number, since it uses less digits than its factorization.
3213362227925 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128150125 (or 128150120 counting only the distinct ones).
The product of its digits is 1632960, while the sum is 47.
The spelling of 3213362227925 in words is "three trillion, two hundred thirteen billion, three hundred sixty-two million, two hundred twenty-seven thousand, nine hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •