Base | Representation |
---|---|
bin | 10011011000000001… |
… | …10111011100011101 |
3 | 222211221101111000210 |
4 | 21230000313130131 |
5 | 132300414213041 |
6 | 4440105043033 |
7 | 515526254064 |
oct | 115400673435 |
9 | 28757344023 |
10 | 10402101021 |
11 | 4458795504 |
12 | 2023786479 |
13 | c9a0b6180 |
14 | 7097131db |
15 | 40d339016 |
hex | 26c03771d |
10402101021 has 32 divisors (see below), whose sum is σ = 15589469952. Its totient is φ = 6127280640.
The previous prime is 10402101011. The next prime is 10402101029. The reversal of 10402101021 is 12010120401.
It is a happy number.
10402101021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10402101021 - 27 = 10402100893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10402100988 and 10402101006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10402101029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23376 + ... + 146118.
It is an arithmetic number, because the mean of its divisors is an integer number (487170936).
Almost surely, 210402101021 is an apocalyptic number.
It is an amenable number.
10402101021 is a deficient number, since it is larger than the sum of its proper divisors (5187368931).
10402101021 is a wasteful number, since it uses less digits than its factorization.
10402101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122853.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10402101021 its reverse (12010120401), we get a palindrome (22412221422).
The spelling of 10402101021 in words is "ten billion, four hundred two million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •