Base | Representation |
---|---|
bin | 1000101001101000… |
… | …0011011100110001 |
3 | 12222211102011201101 |
4 | 2022122003130301 |
5 | 14223423220211 |
6 | 1022230204401 |
7 | 111354255046 |
oct | 21232033461 |
9 | 5884364641 |
10 | 2322085681 |
11 | a91836383 |
12 | 5497b3701 |
13 | 2b01089c6 |
14 | 18057b1cd |
15 | d8cd55c1 |
hex | 8a683731 |
2322085681 has 4 divisors (see below), whose sum is σ = 2423045952. Its totient is φ = 2221125412.
The previous prime is 2322085673. The next prime is 2322085687. The reversal of 2322085681 is 1865802232.
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 2322085681 - 23 = 2322085673 is a prime.
It is a super-2 number, since 2×23220856812 = 10784163819810467522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2322085681.
It is not an unprimeable number, because it can be changed into a prime (2322085687) 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, 50480101 + ... + 50480146.
It is an arithmetic number, because the mean of its divisors is an integer number (605761488).
Almost surely, 22322085681 is an apocalyptic number.
It is an amenable number.
2322085681 is a deficient number, since it is larger than the sum of its proper divisors (100960271).
2322085681 is a wasteful number, since it uses less digits than its factorization.
2322085681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100960270.
The product of its (nonzero) digits is 46080, while the sum is 37.
The square root of 2322085681 is about 48188.0242487695. The cubic root of 2322085681 is about 1324.2177760585.
The spelling of 2322085681 in words is "two billion, three hundred twenty-two million, eighty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •