Base | Representation |
---|---|
bin | 10011010010010010… |
… | …01111110110100001 |
3 | 222201120210222212122 |
4 | 21221021033312201 |
5 | 132201103411442 |
6 | 4431225234025 |
7 | 514403156150 |
oct | 115111176641 |
9 | 28646728778 |
10 | 10353966497 |
11 | 44335a9306 |
12 | 200b632915 |
13 | c90131bc4 |
14 | 703183597 |
15 | 408ecbdd2 |
hex | 26924fda1 |
10353966497 has 4 divisors (see below), whose sum is σ = 11833104576. Its totient is φ = 8874828420.
The previous prime is 10353966481. The next prime is 10353966523. The reversal of 10353966497 is 79466935301.
10353966497 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10353966497 - 24 = 10353966481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10353966797) 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 3 ways as a sum of consecutive naturals, for example, 739569029 + ... + 739569042.
It is an arithmetic number, because the mean of its divisors is an integer number (2958276144).
Almost surely, 210353966497 is an apocalyptic number.
It is an amenable number.
10353966497 is a deficient number, since it is larger than the sum of its proper divisors (1479138079).
10353966497 is an equidigital number, since it uses as much as digits as its factorization.
10353966497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1479138078.
The product of its (nonzero) digits is 3674160, while the sum is 53.
The spelling of 10353966497 in words is "ten billion, three hundred fifty-three million, nine hundred sixty-six thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •