Base | Representation |
---|---|
bin | 10011011000010010… |
… | …11100110110101001 |
3 | 222212002121210222012 |
4 | 21230021130312221 |
5 | 132302003221101 |
6 | 4440225205305 |
7 | 515554346003 |
oct | 115411346651 |
9 | 28762553865 |
10 | 10404351401 |
11 | 4459a92224 |
12 | 2024490835 |
13 | c9a6c3562 |
14 | 709b3b373 |
15 | 40d630bbb |
hex | 26c25cda9 |
10404351401 has 16 divisors (see below), whose sum is σ = 10799464320. Its totient is φ = 10017221760.
The previous prime is 10404351371. The next prime is 10404351437. The reversal of 10404351401 is 10415340401.
10404351401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10404351401 - 226 = 10337242537 is a prime.
It is a super-3 number, since 3×104043514013 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10404351901) 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 15 ways as a sum of consecutive naturals, for example, 1970501 + ... + 1975773.
It is an arithmetic number, because the mean of its divisors is an integer number (674966520).
Almost surely, 210404351401 is an apocalyptic number.
It is an amenable number.
10404351401 is a deficient number, since it is larger than the sum of its proper divisors (395112919).
10404351401 is an equidigital number, since it uses as much as digits as its factorization.
10404351401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6016.
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 10404351401 its reverse (10415340401), we get a palindrome (20819691802).
The spelling of 10404351401 in words is "ten billion, four hundred four million, three hundred fifty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •