Base | Representation |
---|---|
bin | 101110110000100001110… |
… | …010000110111110010101 |
3 | 102101011211121001101001112 |
4 | 232300201302012332111 |
5 | 410121114243240201 |
6 | 10500042541104405 |
7 | 451101102041540 |
oct | 56604162067625 |
9 | 12334747041045 |
10 | 3213202321301 |
11 | 1029790a40315 |
12 | 43a8a6b58105 |
13 | 1a400810b7cb |
14 | b173c56b857 |
15 | 588b1c820bb |
hex | 2ec21c86f95 |
3213202321301 has 32 divisors (see below), whose sum is σ = 3900077475840. Its totient is φ = 2584281139200.
The previous prime is 3213202321289. The next prime is 3213202321309. The reversal of 3213202321301 is 1031232023123.
3213202321301 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 3213202321301 - 222 = 3213198126997 is a prime.
It is a super-2 number, since 2×32132023213012 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3213202321309) 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, 105574556 + ... + 105604986.
It is an arithmetic number, because the mean of its divisors is an integer number (121877421120).
Almost surely, 23213202321301 is an apocalyptic number.
It is an amenable number.
3213202321301 is a deficient number, since it is larger than the sum of its proper divisors (686875154539).
3213202321301 is a wasteful number, since it uses less digits than its factorization.
3213202321301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33125.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 3213202321301 its reverse (1031232023123), we get a palindrome (4244434344424).
The spelling of 3213202321301 in words is "three trillion, two hundred thirteen billion, two hundred two million, three hundred twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •