Base | Representation |
---|---|
bin | 1001011000110010000000… |
… | …0011111111110111111101 |
3 | 1100112201012020021122121221 |
4 | 2112030200003333313331 |
5 | 2323101103122100021 |
6 | 33541320553153341 |
7 | 2113456351161655 |
oct | 226144003776775 |
9 | 40481166248557 |
10 | 10321344331261 |
11 | 331a291886307 |
12 | 11a84193bb851 |
13 | 59b3b601bb32 |
14 | 2797accd7365 |
15 | 12d7363b8241 |
hex | 963200ffdfd |
10321344331261 has 4 divisors (see below), whose sum is σ = 10654290922624. Its totient is φ = 9988397739900.
The previous prime is 10321344331237. The next prime is 10321344331283. The reversal of 10321344331261 is 16213344312301.
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 10321344331261 - 215 = 10321344298493 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 (10321344331201) 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, 166473295635 + ... + 166473295696.
It is an arithmetic number, because the mean of its divisors is an integer number (2663572730656).
Almost surely, 210321344331261 is an apocalyptic number.
It is an amenable number.
10321344331261 is a deficient number, since it is larger than the sum of its proper divisors (332946591363).
10321344331261 is an equidigital number, since it uses as much as digits as its factorization.
10321344331261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332946591362.
The product of its (nonzero) digits is 31104, while the sum is 34.
Adding to 10321344331261 its reverse (16213344312301), we get a palindrome (26534688643562).
The spelling of 10321344331261 in words is "ten trillion, three hundred twenty-one billion, three hundred forty-four million, three hundred thirty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •