Base | Representation |
---|---|
bin | 1001011010000110011101… |
… | …0011100010100101100101 |
3 | 1100121212201011001201002221 |
4 | 2112201213103202211211 |
5 | 2323434020143040141 |
6 | 33555550304032341 |
7 | 2115221214612016 |
oct | 226414723424545 |
9 | 40555634051087 |
10 | 10344014424421 |
11 | 3328965524897 |
12 | 11b08a56026b1 |
13 | 5a058993b742 |
14 | 27a91da6900d |
15 | 12e11175cbd1 |
hex | 968674e2965 |
10344014424421 has 4 divisors (see below), whose sum is σ = 10347449835744. Its totient is φ = 10340579013100.
The previous prime is 10344014424349. The next prime is 10344014424433. The reversal of 10344014424421 is 12442441044301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10344014424421 - 219 = 10344013900133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10344014424481) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1717701145 + ... + 1717707166.
It is an arithmetic number, because the mean of its divisors is an integer number (2586862458936).
Almost surely, 210344014424421 is an apocalyptic number.
It is an amenable number.
10344014424421 is a deficient number, since it is larger than the sum of its proper divisors (3435411323).
10344014424421 is an equidigital number, since it uses as much as digits as its factorization.
10344014424421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3435411322.
The product of its (nonzero) digits is 49152, while the sum is 34.
Adding to 10344014424421 its reverse (12442441044301), we get a palindrome (22786455468722).
The spelling of 10344014424421 in words is "ten trillion, three hundred forty-four billion, fourteen million, four hundred twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •