Base | Representation |
---|---|
bin | 1101010001110110101100… |
… | …1000001011101000111001 |
3 | 1220200210011100210021202011 |
4 | 3110131223020023220321 |
5 | 3403203100113133131 |
6 | 51015154353005521 |
7 | 3034562206033051 |
oct | 324355310135071 |
9 | 56623140707664 |
10 | 14600391146041 |
11 | 4719a9a196a78 |
12 | 17797a15538a1 |
13 | 81ba709429cc |
14 | 38693c650561 |
15 | 1a4bca2810b1 |
hex | d476b20ba39 |
14600391146041 has 2 divisors, whose sum is σ = 14600391146042. Its totient is φ = 14600391146040.
The previous prime is 14600391146021. The next prime is 14600391146057. The reversal of 14600391146041 is 14064119300641.
14600391146041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8571544398400 + 6028846747641 = 2927720^2 + 2455371^2 .
It is a cyclic number.
It is not a de Polignac number, because 14600391146041 - 27 = 14600391145913 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14600391145985 and 14600391146003.
It is not a weakly prime, because it can be changed into another prime (14600391146021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7300195573020 + 7300195573021.
It is an arithmetic number, because the mean of its divisors is an integer number (7300195573021).
Almost surely, 214600391146041 is an apocalyptic number.
It is an amenable number.
14600391146041 is a deficient number, since it is larger than the sum of its proper divisors (1).
14600391146041 is an equidigital number, since it uses as much as digits as its factorization.
14600391146041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62208, while the sum is 40.
The spelling of 14600391146041 in words is "fourteen trillion, six hundred billion, three hundred ninety-one million, one hundred forty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •