Base | Representation |
---|---|
bin | 1001011101011111010010… |
… | …1101010001111011000101 |
3 | 1100211102221200122002111201 |
4 | 2113113310231101323011 |
5 | 2330412222130143323 |
6 | 34042414200102501 |
7 | 2122351512311332 |
oct | 227276455217305 |
9 | 40742850562451 |
10 | 10402221334213 |
11 | 3350614837715 |
12 | 120002aa64a31 |
13 | 5a5c04a579b7 |
14 | 27d682323989 |
15 | 1308bb86e8ad |
hex | 975f4b51ec5 |
10402221334213 has 4 divisors (see below), whose sum is σ = 10557478369120. Its totient is φ = 10246964299308.
The previous prime is 10402221334181. The next prime is 10402221334259. The reversal of 10402221334213 is 31243312220401.
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 10402221334213 - 25 = 10402221334181 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 (10402221334913) 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, 77628517353 + ... + 77628517486.
It is an arithmetic number, because the mean of its divisors is an integer number (2639369592280).
Almost surely, 210402221334213 is an apocalyptic number.
It is an amenable number.
10402221334213 is a deficient number, since it is larger than the sum of its proper divisors (155257034907).
10402221334213 is an equidigital number, since it uses as much as digits as its factorization.
10402221334213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155257034906.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 10402221334213 its reverse (31243312220401), we get a palindrome (41645533554614).
The spelling of 10402221334213 in words is "ten trillion, four hundred two billion, two hundred twenty-one million, three hundred thirty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •