Base | Representation |
---|---|
bin | 101110110001010001011… |
… | …000111001110110111001 |
3 | 102101020220020221111011121 |
4 | 232301101120321312321 |
5 | 410124233230122340 |
6 | 10500254112025241 |
7 | 451126640626303 |
oct | 56612130716671 |
9 | 12336806844147 |
10 | 3214001020345 |
11 | 102a060872775 |
12 | 43aa8a532221 |
13 | 1a41047274ab |
14 | b17b6678973 |
15 | 5890be4d94a |
hex | 2ec51639db9 |
3214001020345 has 16 divisors (see below), whose sum is σ = 3863233272528. Its totient is φ = 2566915142400.
The previous prime is 3214001020309. The next prime is 3214001020393. The reversal of 3214001020345 is 5430201004123.
It can be written as a sum of positive squares in 8 ways, for example, as 927409446441 + 2286591573904 = 963021^2 + 1512148^2 .
It is not a de Polignac number, because 3214001020345 - 211 = 3214001018297 is a prime.
It is a super-2 number, since 2×32140010203452 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10895295 + ... + 11186395.
It is an arithmetic number, because the mean of its divisors is an integer number (241452079533).
Almost surely, 23214001020345 is an apocalyptic number.
It is an amenable number.
3214001020345 is a deficient number, since it is larger than the sum of its proper divisors (649232252183).
3214001020345 is a wasteful number, since it uses less digits than its factorization.
3214001020345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294780.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 3214001020345 its reverse (5430201004123), we get a palindrome (8644202024468).
The spelling of 3214001020345 in words is "three trillion, two hundred fourteen billion, one million, twenty thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •