Base | Representation |
---|---|
bin | 10100111110001011111000… |
… | …001101111101010100000001 |
3 | 110002120111211101220011000001 |
4 | 110332023320031331110001 |
5 | 44042131312240413011 |
6 | 524055503204000001 |
7 | 25266464512253446 |
oct | 2476137015752401 |
9 | 402514741804001 |
10 | 92234292122881 |
11 | 274303863a6667 |
12 | a417759990001 |
13 | 3c6086c22802c |
14 | 18ac240b359cd |
15 | a9e35b6327c1 |
hex | 53e2f837d501 |
92234292122881 has 4 divisors (see below), whose sum is σ = 92280157014064. Its totient is φ = 92188427231700.
The previous prime is 92234292122839. The next prime is 92234292122963. The reversal of 92234292122881 is 18822129243229.
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 92234292122881 - 215 = 92234292090113 is a prime.
It is a super-2 number, since 2×922342921228812 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (92234292122831) 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, 22932442575 + ... + 22932446596.
It is an arithmetic number, because the mean of its divisors is an integer number (23070039253516).
Almost surely, 292234292122881 is an apocalyptic number.
It is an amenable number.
92234292122881 is a deficient number, since it is larger than the sum of its proper divisors (45864891183).
92234292122881 is a wasteful number, since it uses less digits than its factorization.
92234292122881 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45864891182.
The product of its digits is 3981312, while the sum is 55.
The spelling of 92234292122881 in words is "ninety-two trillion, two hundred thirty-four billion, two hundred ninety-two million, one hundred twenty-two thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •