Base | Representation |
---|---|
bin | 10100101111111010100110… |
… | …001001110110000011111001 |
3 | 102222002202122122202112002121 |
4 | 110233322212021312003321 |
5 | 43430100000132110101 |
6 | 522025204241401241 |
7 | 25135600555265506 |
oct | 2457724611660371 |
9 | 388082578675077 |
10 | 91253662769401 |
11 | 27092508723150 |
12 | a2996a3039221 |
13 | 3bbc250131912 |
14 | 18769b518a4ad |
15 | a83ab576c0a1 |
hex | 52fea62760f9 |
91253662769401 has 8 divisors (see below), whose sum is σ = 99995860387584. Its totient is φ = 82585866833520.
The previous prime is 91253662769383. The next prime is 91253662769429. The reversal of 91253662769401 is 10496726635219.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 91253662769401 - 211 = 91253662767353 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 91253662769401.
It is not an unprimeable number, because it can be changed into a prime (91253662769471) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18600418006 + ... + 18600422911.
It is an arithmetic number, because the mean of its divisors is an integer number (12499482548448).
Almost surely, 291253662769401 is an apocalyptic number.
It is an amenable number.
91253662769401 is a deficient number, since it is larger than the sum of its proper divisors (8742197618183).
91253662769401 is a wasteful number, since it uses less digits than its factorization.
91253662769401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37200841151.
The product of its (nonzero) digits is 29393280, while the sum is 61.
The spelling of 91253662769401 in words is "ninety-one trillion, two hundred fifty-three billion, six hundred sixty-two million, seven hundred sixty-nine thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •