Base | Representation |
---|---|
bin | 1001011110000111110101… |
… | …1000100101000111111101 |
3 | 1100212111001010220002211012 |
4 | 2113201331120211013331 |
5 | 2331102014201233041 |
6 | 34051414124205005 |
7 | 2123215301213003 |
oct | 227417530450775 |
9 | 40774033802735 |
10 | 10413104321021 |
11 | 3355199a13796 |
12 | 1202167699765 |
13 | 5a6c4a662a6c |
14 | 27ddd5854a73 |
15 | 130d06ee83eb |
hex | 9787d6251fd |
10413104321021 has 4 divisors (see below), whose sum is σ = 10961162443200. Its totient is φ = 9865046198844.
The previous prime is 10413104321017. The next prime is 10413104321033. The reversal of 10413104321021 is 12012340131401.
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 10413104321021 - 22 = 10413104321017 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 (10413104321041) 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, 274029061061 + ... + 274029061098.
It is an arithmetic number, because the mean of its divisors is an integer number (2740290610800).
Almost surely, 210413104321021 is an apocalyptic number.
It is an amenable number.
10413104321021 is a deficient number, since it is larger than the sum of its proper divisors (548058122179).
10413104321021 is an equidigital number, since it uses as much as digits as its factorization.
10413104321021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 548058122178.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 10413104321021 its reverse (12012340131401), we get a palindrome (22425444452422).
The spelling of 10413104321021 in words is "ten trillion, four hundred thirteen billion, one hundred four million, three hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •