Base | Representation |
---|---|
bin | 10010101100110111… |
… | …11100010110010001 |
3 | 221220201012221022111 |
4 | 21112123330112101 |
5 | 131030231201431 |
6 | 4340134105321 |
7 | 503542305163 |
oct | 112633742621 |
9 | 27821187274 |
10 | 10040100241 |
11 | 4292413a06 |
12 | 1b424ab241 |
13 | c400ba822 |
14 | 6b3600933 |
15 | 3db67e7b1 |
hex | 2566fc591 |
10040100241 has 4 divisors (see below), whose sum is σ = 10101696112. Its totient is φ = 9978504372.
The previous prime is 10040100221. The next prime is 10040100253. The reversal of 10040100241 is 14200104001.
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, and also an emirpimes, since its reverse is a distinct semiprime: 14200104001 = 31 ⋅458067871.
It is a cyclic number.
It is not a de Polignac number, because 10040100241 - 27 = 10040100113 is a prime.
It is a super-2 number, since 2×100401002412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10040100221) 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, 30797691 + ... + 30798016.
It is an arithmetic number, because the mean of its divisors is an integer number (2525424028).
Almost surely, 210040100241 is an apocalyptic number.
It is an amenable number.
10040100241 is a deficient number, since it is larger than the sum of its proper divisors (61595871).
10040100241 is an equidigital number, since it uses as much as digits as its factorization.
10040100241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61595870.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10040100241 its reverse (14200104001), we get a palindrome (24240204242).
The spelling of 10040100241 in words is "ten billion, forty million, one hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •