Base | Representation |
---|---|
bin | 10011101000101101… |
… | …00101101100101000 |
3 | 1000012200122202111020 |
4 | 21310112211230220 |
5 | 133042223410344 |
6 | 4502023532440 |
7 | 522145430301 |
oct | 116426455450 |
9 | 30180582436 |
10 | 10542013224 |
11 | 451a767626 |
12 | 20625ba120 |
13 | cc0092562 |
14 | 7201337a8 |
15 | 41a774719 |
hex | 2745a5b28 |
10542013224 has 16 divisors (see below), whose sum is σ = 26355033120. Its totient is φ = 3514004400.
The previous prime is 10542013159. The next prime is 10542013241. The reversal of 10542013224 is 42231024501.
It is a super-2 number, since 2×105420132242 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 439250551 = 10542013224 / (1 + 0 + 5 + 4 + 2 + 0 + 1 + 3 + 2 + 2 + 4).
It is a junction number, because it is equal to n+sod(n) for n = 10542013194 and 10542013203.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 219625252 + ... + 219625299.
It is an arithmetic number, because the mean of its divisors is an integer number (1647189570).
Almost surely, 210542013224 is an apocalyptic number.
It is an amenable number.
10542013224 is an abundant number, since it is smaller than the sum of its proper divisors (15813019896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10542013224 is a wasteful number, since it uses less digits than its factorization.
10542013224 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 439250560 (or 439250556 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 10542013224 its reverse (42231024501), we get a palindrome (52773037725).
The spelling of 10542013224 in words is "ten billion, five hundred forty-two million, thirteen thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •