Base | Representation |
---|---|
bin | 100111111100… |
… | …110001100111 |
3 | 201201001122021 |
4 | 213330301213 |
5 | 10140110201 |
6 | 1012244011 |
7 | 155005135 |
oct | 47746147 |
9 | 21631567 |
10 | 10472551 |
11 | 5a03201 |
12 | 3610607 |
13 | 222899b |
14 | 1568755 |
15 | dbcea1 |
hex | 9fcc67 |
10472551 has 4 divisors (see below), whose sum is σ = 10479600. Its totient is φ = 10465504.
The previous prime is 10472543. The next prime is 10472557. The reversal of 10472551 is 15527401.
10472551 is digitally balanced in base 3, 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 brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 15527401 = 127 ⋅122263.
It is a cyclic number.
It is not a de Polignac number, because 10472551 - 23 = 10472543 is a prime.
It is a Duffinian number.
It is a plaindrome in base 13.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10472557) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 331 + ... + 4588.
It is an arithmetic number, because the mean of its divisors is an integer number (2619900).
Almost surely, 210472551 is an apocalyptic number.
10472551 is a deficient number, since it is larger than the sum of its proper divisors (7049).
10472551 is an equidigital number, since it uses as much as digits as its factorization.
10472551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7048.
The product of its (nonzero) digits is 1400, while the sum is 25.
The square root of 10472551 is about 3236.1321048437. The cubic root of 10472551 is about 218.7849755232.
Adding to 10472551 its reverse (15527401), we get a palindrome (25999952).
The spelling of 10472551 in words is "ten million, four hundred seventy-two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •