Base | Representation |
---|---|
bin | 1100111011010111010100… |
… | …0010101001010001011001 |
3 | 1212022211211211021012202201 |
4 | 3032311311002221101121 |
5 | 3330340243131110243 |
6 | 50121454244530201 |
7 | 2664633300001135 |
oct | 316656502512131 |
9 | 55284754235681 |
10 | 14214010410073 |
11 | 4590145355291 |
12 | 171692b3b0961 |
13 | 7c14b5a883a6 |
14 | 371d671763c5 |
15 | 199b1436004d |
hex | ced750a9459 |
14214010410073 has 2 divisors, whose sum is σ = 14214010410074. Its totient is φ = 14214010410072.
The previous prime is 14214010409801. The next prime is 14214010410077. The reversal of 14214010410073 is 37001401041241.
14214010410073 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., 14140705930569 + 73304479504 = 3760413^2 + 270748^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14214010410073 is a prime.
It is a super-2 number, since 2×142140104100732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14214010410077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7107005205036 + 7107005205037.
It is an arithmetic number, because the mean of its divisors is an integer number (7107005205037).
Almost surely, 214214010410073 is an apocalyptic number.
It is an amenable number.
14214010410073 is a deficient number, since it is larger than the sum of its proper divisors (1).
14214010410073 is an equidigital number, since it uses as much as digits as its factorization.
14214010410073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2688, while the sum is 28.
The spelling of 14214010410073 in words is "fourteen trillion, two hundred fourteen billion, ten million, four hundred ten thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •