Base | Representation |
---|---|
bin | 111010111000100100… |
… | …011001110110001101 |
3 | 20001012100001022021222 |
4 | 322320210121312031 |
5 | 2013441334433231 |
6 | 45013510333125 |
7 | 4365541631324 |
oct | 727044316615 |
9 | 201170038258 |
10 | 63226092941 |
11 | 248a5532480 |
12 | 1030635a1a5 |
13 | 5c67c3351b |
14 | 30bb1110bb |
15 | 19a0aa727b |
hex | eb8919d8d |
63226092941 has 4 divisors (see below), whose sum is σ = 68973919584. Its totient is φ = 57478266300.
The previous prime is 63226092899. The next prime is 63226092959. The reversal of 63226092941 is 14929062236.
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 63226092941 - 222 = 63221898637 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 63226092892 and 63226092901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63226092641) 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 3 ways as a sum of consecutive naturals, for example, 2873913305 + ... + 2873913326.
It is an arithmetic number, because the mean of its divisors is an integer number (17243479896).
Almost surely, 263226092941 is an apocalyptic number.
It is an amenable number.
63226092941 is a deficient number, since it is larger than the sum of its proper divisors (5747826643).
63226092941 is a wasteful number, since it uses less digits than its factorization.
63226092941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5747826642.
The product of its (nonzero) digits is 279936, while the sum is 44.
The spelling of 63226092941 in words is "sixty-three billion, two hundred twenty-six million, ninety-two thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •