Base | Representation |
---|---|
bin | 10011101001110100… |
… | …11010001100111100 |
3 | 1000020100022211021201 |
4 | 21310322122030330 |
5 | 133102124401244 |
6 | 4503001105244 |
7 | 522321306550 |
oct | 116472321474 |
9 | 30210284251 |
10 | 10551403324 |
11 | 4524aa0540 |
12 | 2065788224 |
13 | cc1ccc627 |
14 | 721499860 |
15 | 41b4cbad4 |
hex | 274e9a33c |
10551403324 has 24 divisors (see below), whose sum is σ = 23021244288. Its totient is φ = 4110936240.
The previous prime is 10551403307. The next prime is 10551403351. The reversal of 10551403324 is 42330415501.
It is a super-2 number, since 2×105514033242 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 10551403292 and 10551403301.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17128594 + ... + 17129209.
It is an arithmetic number, because the mean of its divisors is an integer number (959218512).
Almost surely, 210551403324 is an apocalyptic number.
10551403324 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10551403324 is an abundant number, since it is smaller than the sum of its proper divisors (12469840964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10551403324 is a wasteful number, since it uses less digits than its factorization.
10551403324 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34257825 (or 34257823 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 10551403324 its reverse (42330415501), we get a palindrome (52881818825).
The spelling of 10551403324 in words is "ten billion, five hundred fifty-one million, four hundred three thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •