Base | Representation |
---|---|
bin | 10011011000010011… |
… | …10101110001100011 |
3 | 222212002210222222201 |
4 | 21230021311301203 |
5 | 132302020002400 |
6 | 4440231314031 |
7 | 515555252413 |
oct | 115411656143 |
9 | 28762728881 |
10 | 10404453475 |
11 | 445a051989 |
12 | 202451b917 |
13 | c9a72ab60 |
14 | 709b66643 |
15 | 40d65106a |
hex | 26c275c63 |
10404453475 has 48 divisors (see below), whose sum is σ = 14733556992. Its totient is φ = 7220367360.
The previous prime is 10404453473. The next prime is 10404453551. The reversal of 10404453475 is 57435440401.
10404453475 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 10404453475 - 21 = 10404453473 is a prime.
It is a super-2 number, since 2×104044534752 (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 (10404453473) 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 47 ways as a sum of consecutive naturals, for example, 5706414 + ... + 5708236.
It is an arithmetic number, because the mean of its divisors is an integer number (306949104).
Almost surely, 210404453475 is an apocalyptic number.
10404453475 is a deficient number, since it is larger than the sum of its proper divisors (4329103517).
10404453475 is a wasteful number, since it uses less digits than its factorization.
10404453475 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2896 (or 2891 counting only the distinct ones).
The product of its (nonzero) digits is 134400, while the sum is 37.
Adding to 10404453475 its reverse (57435440401), we get a palindrome (67839893876).
The spelling of 10404453475 in words is "ten billion, four hundred four million, four hundred fifty-three thousand, four hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •