Base | Representation |
---|---|
bin | 10010101110110001… |
… | …10010000100101101 |
3 | 221221211020012211002 |
4 | 21113120302010231 |
5 | 131043322031231 |
6 | 4341504010045 |
7 | 504125001641 |
oct | 112730620455 |
9 | 27854205732 |
10 | 10056048941 |
11 | 42a0417454 |
12 | 1b47900925 |
13 | c434b2c23 |
14 | 6b5792c21 |
15 | 3dcc800cb |
hex | 25763212d |
10056048941 has 4 divisors (see below), whose sum is σ = 10155613884. Its totient is φ = 9956484000.
The previous prime is 10056048923. The next prime is 10056048943. The reversal of 10056048941 is 14984065001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9181664041 + 874384900 = 95821^2 + 29570^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10056048941 is a prime.
It is a super-2 number, since 2×100560489412 (a number of 21 digits) contains 22 as substring.
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 = 10056048895 and 10056048904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10056048943) 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, 49782320 + ... + 49782521.
It is an arithmetic number, because the mean of its divisors is an integer number (2538903471).
Almost surely, 210056048941 is an apocalyptic number.
It is an amenable number.
10056048941 is a deficient number, since it is larger than the sum of its proper divisors (99564943).
10056048941 is an equidigital number, since it uses as much as digits as its factorization.
10056048941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99564942.
The product of its (nonzero) digits is 34560, while the sum is 38.
The spelling of 10056048941 in words is "ten billion, fifty-six million, forty-eight thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •