Base | Representation |
---|---|
bin | 10011101001111001… |
… | …01110101011001001 |
3 | 1000020101110201111110 |
4 | 21310330232223021 |
5 | 133102303331330 |
6 | 4503022120533 |
7 | 522326421552 |
oct | 116474565311 |
9 | 30211421443 |
10 | 10552011465 |
11 | 4525376436 |
12 | 2065a20149 |
13 | cc2183388 |
14 | 7215b7329 |
15 | 41b59bdb0 |
hex | 274f2eac9 |
10552011465 has 8 divisors (see below), whose sum is σ = 16883218368. Its totient is φ = 5627739440.
The previous prime is 10552011419. The next prime is 10552011467. The reversal of 10552011465 is 56411025501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10552011465 - 212 = 10552007369 is a prime.
It is a super-2 number, since 2×105520114652 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10552011467) 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 7 ways as a sum of consecutive naturals, for example, 351733701 + ... + 351733730.
It is an arithmetic number, because the mean of its divisors is an integer number (2110402296).
Almost surely, 210552011465 is an apocalyptic number.
10552011465 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10552011465 is a deficient number, since it is larger than the sum of its proper divisors (6331206903).
10552011465 is an equidigital number, since it uses as much as digits as its factorization.
10552011465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703467439.
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 10552011465 its reverse (56411025501), we get a palindrome (66963036966).
The spelling of 10552011465 in words is "ten billion, five hundred fifty-two million, eleven thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •