Base | Representation |
---|---|
bin | 10011101001110011… |
… | …10001101001010001 |
3 | 1000020100000101102000 |
4 | 21310321301221101 |
5 | 133102104042301 |
6 | 4502553344213 |
7 | 522320015331 |
oct | 116471615121 |
9 | 30210011360 |
10 | 10551237201 |
11 | 452499774a |
12 | 2065708069 |
13 | cc1c71b2b |
14 | 7214550c1 |
15 | 41b497786 |
hex | 274e71a51 |
10551237201 has 16 divisors (see below), whose sum is σ = 16053936000. Its totient is φ = 6844045104.
The previous prime is 10551237197. The next prime is 10551237217. The reversal of 10551237201 is 10273215501.
10551237201 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 10551237201 - 22 = 10551237197 is a prime.
It is a super-2 number, since 2×105512372012 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10551237241) 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 15 ways as a sum of consecutive naturals, for example, 5279901 + ... + 5281898.
It is an arithmetic number, because the mean of its divisors is an integer number (1003371000).
Almost surely, 210551237201 is an apocalyptic number.
It is an amenable number.
10551237201 is a deficient number, since it is larger than the sum of its proper divisors (5502698799).
10551237201 is a wasteful number, since it uses less digits than its factorization.
10551237201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10561845 (or 10561839 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The spelling of 10551237201 in words is "ten billion, five hundred fifty-one million, two hundred thirty-seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •