Base | Representation |
---|---|
bin | 1001011001110111101010… |
… | …0101111010111000010001 |
3 | 1100121111110101012121001000 |
4 | 2112131322211322320101 |
5 | 2323402402004323241 |
6 | 33554052235332213 |
7 | 2115020622456366 |
oct | 226357245727021 |
9 | 40544411177030 |
10 | 10340043042321 |
11 | 3327207807723 |
12 | 11abb775b1069 |
13 | 5a00a5c29bc5 |
14 | 27a66444446d |
15 | 12de7cc8beb6 |
hex | 9677a97ae11 |
10340043042321 has 32 divisors (see below), whose sum is σ = 15682771440000. Its totient is φ = 6731045193024.
The previous prime is 10340043042317. The next prime is 10340043042403. The reversal of 10340043042321 is 12324034004301.
10340043042321 is a `hidden beast` number, since 1 + 0 + 34 + 0 + 0 + 4 + 304 + 2 + 321 = 666.
It is not a de Polignac number, because 10340043042321 - 22 = 10340043042317 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10340033042321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21544270 + ... + 22018983.
It is an arithmetic number, because the mean of its divisors is an integer number (490086607500).
Almost surely, 210340043042321 is an apocalyptic number.
It is an amenable number.
10340043042321 is a deficient number, since it is larger than the sum of its proper divisors (5342728397679).
10340043042321 is a wasteful number, since it uses less digits than its factorization.
10340043042321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43563470 (or 43563464 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 10340043042321 its reverse (12324034004301), we get a palindrome (22664077046622).
The spelling of 10340043042321 in words is "ten trillion, three hundred forty billion, forty-three million, forty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •