Base | Representation |
---|---|
bin | 10011011000011000… |
… | …10011101010101001 |
3 | 222212011000212010112 |
4 | 21230030103222221 |
5 | 132302201201301 |
6 | 4440253224105 |
7 | 515563615046 |
oct | 115414235251 |
9 | 28764025115 |
10 | 10405100201 |
11 | 445a453871 |
12 | 2024792035 |
13 | c9a8c6332 |
14 | 709c941cd |
15 | 40d72c9bb |
hex | 26c313aa9 |
10405100201 has 4 divisors (see below), whose sum is σ = 10560400272. Its totient is φ = 10249800132.
The previous prime is 10405100177. The next prime is 10405100213. The reversal of 10405100201 is 10200150401.
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: 10200150401 = 7 ⋅1457164343.
It is a cyclic number.
It is not a de Polignac number, because 10405100201 - 26 = 10405100137 is a prime.
It is a super-2 number, since 2×104051002012 (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 (10405100261) 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, 77649935 + ... + 77650068.
It is an arithmetic number, because the mean of its divisors is an integer number (2640100068).
Almost surely, 210405100201 is an apocalyptic number.
It is an amenable number.
10405100201 is a deficient number, since it is larger than the sum of its proper divisors (155300071).
10405100201 is an equidigital number, since it uses as much as digits as its factorization.
10405100201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155300070.
The product of its (nonzero) digits is 40, while the sum is 14.
Adding to 10405100201 its reverse (10200150401), we get a palindrome (20605250602).
The spelling of 10405100201 in words is "ten billion, four hundred five million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.075 sec. • engine limits •