Base | Representation |
---|---|
bin | 10100101100011001100011… |
… | …001111100000000010010001 |
3 | 102221020122221022001002100001 |
4 | 110230121203033200002101 |
5 | 43412120110113310001 |
6 | 521322202401330001 |
7 | 25112254514600551 |
oct | 2454314317400221 |
9 | 387218838032301 |
10 | 91012022010001 |
11 | 26aa9a88823104 |
12 | a25a8a6036901 |
13 | 3ba2520b56051 |
14 | 1869010a37161 |
15 | a7c671760001 |
hex | 52c6633e0091 |
91012022010001 has 32 divisors (see below), whose sum is σ = 97695724492800. Its totient is φ = 84535050600000.
The previous prime is 91012022009969. The next prime is 91012022010031. The reversal of 91012022010001 is 10001022021019.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 91012022010001 - 25 = 91012022009969 is a prime.
It is a super-4 number, since 4×910120220100014 (a number of 57 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (91012022010031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 124339671 + ... + 125069491.
It is an arithmetic number, because the mean of its divisors is an integer number (3052991390400).
Almost surely, 291012022010001 is an apocalyptic number.
It is an amenable number.
91012022010001 is a deficient number, since it is larger than the sum of its proper divisors (6683702482799).
91012022010001 is a wasteful number, since it uses less digits than its factorization.
91012022010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 730501.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 91012022010001 in words is "ninety-one trillion, twelve billion, twenty-two million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •