Base | Representation |
---|---|
bin | 1001011101011111101000… |
… | …0100111110110001010101 |
3 | 1100211110011222011121012222 |
4 | 2113113322010332301111 |
5 | 2330412413211331201 |
6 | 34042431135152125 |
7 | 2122353655166024 |
oct | 227277204766125 |
9 | 40743158147188 |
10 | 10402311433301 |
11 | 3350660686477 |
12 | 1200055075645 |
13 | 5a5c1a612a78 |
14 | 27d6902988bb |
15 | 1308c471a91b |
hex | 975fa13ec55 |
10402311433301 has 4 divisors (see below), whose sum is σ = 10402403580192. Its totient is φ = 10402219286412.
The previous prime is 10402311433291. The next prime is 10402311433307. The reversal of 10402311433301 is 10333411320401.
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 10402311433301 - 26 = 10402311433237 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 (10402311433307) 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, 45903905 + ... + 46129958.
It is an arithmetic number, because the mean of its divisors is an integer number (2600600895048).
Almost surely, 210402311433301 is an apocalyptic number.
It is an amenable number.
10402311433301 is a deficient number, since it is larger than the sum of its proper divisors (92146891).
10402311433301 is an equidigital number, since it uses as much as digits as its factorization.
10402311433301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92146890.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 10402311433301 its reverse (10333411320401), we get a palindrome (20735722753702).
The spelling of 10402311433301 in words is "ten trillion, four hundred two billion, three hundred eleven million, four hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •