Base | Representation |
---|---|
bin | 101110110000010110011… |
… | …110000011000111010011 |
3 | 102101011100100220010100011 |
4 | 232300112132003013103 |
5 | 410120222200410420 |
6 | 10500012040535351 |
7 | 451063305513340 |
oct | 56602636030723 |
9 | 12334310803304 |
10 | 3213012513235 |
11 | 10296a3889748 |
12 | 43a853481557 |
13 | 1a3ca79b2545 |
14 | b172127d7c7 |
15 | 588a028c95a |
hex | 2ec167831d3 |
3213012513235 has 32 divisors (see below), whose sum is σ = 4477537539072. Its totient is φ = 2167920892800.
The previous prime is 3213012513229. The next prime is 3213012513247. The reversal of 3213012513235 is 5323152103123.
3213012513235 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 3213012513235 - 219 = 3213011988947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3213012513197 and 3213012513206.
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, 2272441 + ... + 3404410.
It is an arithmetic number, because the mean of its divisors is an integer number (139923048096).
Almost surely, 23213012513235 is an apocalyptic number.
3213012513235 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
3213012513235 is a deficient number, since it is larger than the sum of its proper divisors (1264525025837).
3213012513235 is a wasteful number, since it uses less digits than its factorization.
3213012513235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5677123.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 3213012513235 its reverse (5323152103123), we get a palindrome (8536164616358).
The spelling of 3213012513235 in words is "three trillion, two hundred thirteen billion, twelve million, five hundred thirteen thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •