Base | Representation |
---|---|
bin | 10100101111010100110100… |
… | …011100011001000100100111 |
3 | 102221221212221210100202100001 |
4 | 110233110310130121010213 |
5 | 43423413412140314421 |
6 | 521554415251402131 |
7 | 25132633441214554 |
oct | 2457246434310447 |
9 | 387855853322301 |
10 | 91213100323111 |
11 | 27077293236968 |
12 | a2918628b3347 |
13 | 3bb84876a1a00 |
14 | 1874a4800da2b |
15 | a829de6d4691 |
hex | 52f534719127 |
91213100323111 has 6 divisors (see below), whose sum is σ = 98769215142960. Its totient is φ = 84196707990408.
The previous prime is 91213100323031. The next prime is 91213100323151. The reversal of 91213100323111 is 11132300131219.
It is a de Polignac number, because none of the positive numbers 2k-91213100323111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 91213100323111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (91213100323151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 269861243391 + ... + 269861243728.
It is an arithmetic number, because the mean of its divisors is an integer number (16461535857160).
Almost surely, 291213100323111 is an apocalyptic number.
91213100323111 is a deficient number, since it is larger than the sum of its proper divisors (7556114819849).
91213100323111 is a wasteful number, since it uses less digits than its factorization.
91213100323111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539722487145 (or 539722487132 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 28.
The spelling of 91213100323111 in words is "ninety-one trillion, two hundred thirteen billion, one hundred million, three hundred twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •