Base | Representation |
---|---|
bin | 10010101011110011… |
… | …01100011001111001 |
3 | 221220002022210112120 |
4 | 21111321230121321 |
5 | 131020431401131 |
6 | 4335213431453 |
7 | 503403062523 |
oct | 112571543171 |
9 | 27802283476 |
10 | 10031122041 |
11 | 4288341506 |
12 | 1b3b49b589 |
13 | c3b296095 |
14 | 6b2344a13 |
15 | 3da9a9496 |
hex | 255e6c679 |
10031122041 has 4 divisors (see below), whose sum is σ = 13374829392. Its totient is φ = 6687414692.
The previous prime is 10031122037. The next prime is 10031122061. The reversal of 10031122041 is 14022113001.
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 10031122041 - 22 = 10031122037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10031122041.
It is not an unprimeable number, because it can be changed into a prime (10031122061) 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, 1671853671 + ... + 1671853676.
It is an arithmetic number, because the mean of its divisors is an integer number (3343707348).
Almost surely, 210031122041 is an apocalyptic number.
It is an amenable number.
10031122041 is a deficient number, since it is larger than the sum of its proper divisors (3343707351).
10031122041 is an equidigital number, since it uses as much as digits as its factorization.
10031122041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3343707350.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10031122041 its reverse (14022113001), we get a palindrome (24053235042).
The spelling of 10031122041 in words is "ten billion, thirty-one million, one hundred twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •