Base | Representation |
---|---|
bin | 101100011111111001011010… |
… | …1001110111100110010110001 |
3 | 1220022212121210021112200221211 |
4 | 1120333302311032330302301 |
5 | 402300343234023323233 |
6 | 3504244105054520121 |
7 | 145305404151123220 |
oct | 13077626516746261 |
9 | 1808777707480854 |
10 | 391412000214193 |
11 | 103796996038462 |
12 | 37a96326b06041 |
13 | 13a52cbb20756a |
14 | 6c9262879acb7 |
15 | 303b7ceb0e5cd |
hex | 163fcb53bccb1 |
391412000214193 has 16 divisors (see below), whose sum is σ = 469640706610176. Its totient is φ = 318940449339600.
The previous prime is 391412000214143. The next prime is 391412000214197.
391412000214193 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 391412000214193 - 213 = 391412000206001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (391412000214197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7457429083 + ... + 7457481568.
It is an arithmetic number, because the mean of its divisors is an integer number (29352544163136).
Almost surely, 2391412000214193 is an apocalyptic number.
It is an amenable number.
391412000214193 is a deficient number, since it is larger than the sum of its proper divisors (78228706395983).
391412000214193 is a wasteful number, since it uses less digits than its factorization.
391412000214193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14914910844.
The product of its (nonzero) digits is 46656, while the sum is 40.
It can be divided in two parts, 391412000 and 214193, that added together give a palindrome (391626193).
The spelling of 391412000214193 in words is "three hundred ninety-one trillion, four hundred twelve billion, two hundred fourteen thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •