Base | Representation |
---|---|
bin | 10011010111111010… |
… | …11100000011100011 |
3 | 222211212200211100122 |
4 | 21223331130003203 |
5 | 132300201434103 |
6 | 4440033510455 |
7 | 515515522154 |
oct | 115375340343 |
9 | 28755624318 |
10 | 10401202403 |
11 | 4458231349 |
12 | 202341242b |
13 | c99b60147 |
14 | 70955b92b |
15 | 40d20cb38 |
hex | 26bf5c0e3 |
10401202403 has 4 divisors (see below), whose sum is σ = 10406884848. Its totient is φ = 10395519960.
The previous prime is 10401202373. The next prime is 10401202421. The reversal of 10401202403 is 30420210401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30420210401 = 7 ⋅4345744343.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10401202403 is a prime.
It is a super-2 number, since 2×104012024032 (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 (10401207403) 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, 2838476 + ... + 2842137.
It is an arithmetic number, because the mean of its divisors is an integer number (2601721212).
Almost surely, 210401202403 is an apocalyptic number.
10401202403 is a deficient number, since it is larger than the sum of its proper divisors (5682445).
10401202403 is an equidigital number, since it uses as much as digits as its factorization.
10401202403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5682444.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 10401202403 its reverse (30420210401), we get a palindrome (40821412804).
The spelling of 10401202403 in words is "ten billion, four hundred one million, two hundred two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •