Base | Representation |
---|---|
bin | 10011000000000011… |
… | …10001010011001101 |
3 | 222022221000001221020 |
4 | 21200001301103031 |
5 | 131342424331110 |
6 | 4404123024353 |
7 | 510535111014 |
oct | 114001612315 |
9 | 28287001836 |
10 | 10201011405 |
11 | 4365228942 |
12 | 1b8836b0b9 |
13 | c67539c30 |
14 | 6cab29a7b |
15 | 3ea866d70 |
hex | 2600714cd |
10201011405 has 32 divisors (see below), whose sum is σ = 18341358336. Its totient is φ = 4803684864.
The previous prime is 10201011371. The next prime is 10201011409. The reversal of 10201011405 is 50411010201.
It is a happy number.
It is not a de Polignac number, because 10201011405 - 26 = 10201011341 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201011409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1132752 + ... + 1141721.
It is an arithmetic number, because the mean of its divisors is an integer number (573167448).
Almost surely, 210201011405 is an apocalyptic number.
10201011405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10201011405 is a deficient number, since it is larger than the sum of its proper divisors (8140346931).
10201011405 is a wasteful number, since it uses less digits than its factorization.
10201011405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2274517.
The product of its (nonzero) digits is 40, while the sum is 15.
Adding to 10201011405 its reverse (50411010201), we get a palindrome (60612021606).
The spelling of 10201011405 in words is "ten billion, two hundred one million, eleven thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •