Base | Representation |
---|---|
bin | 10011101100010010… |
… | …11100011111000011 |
3 | 1000021210022110000222 |
4 | 21312021130133003 |
5 | 133122430401201 |
6 | 4505021133255 |
7 | 522662361161 |
oct | 116611343703 |
9 | 30253273028 |
10 | 10572122051 |
11 | 4535761857 |
12 | 20706ba22b |
13 | cc63a4c2a |
14 | 724130231 |
15 | 41d22091b |
hex | 27625c7c3 |
10572122051 has 4 divisors (see below), whose sum is σ = 10572355272. Its totient is φ = 10571888832.
The previous prime is 10572122047. The next prime is 10572122069. The reversal of 10572122051 is 15022127501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15022127501 = 331 ⋅45384071.
It is a cyclic number.
It is not a de Polignac number, because 10572122051 - 22 = 10572122047 is a prime.
It is a super-2 number, since 2×105721220512 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10572122051.
It is not an unprimeable number, because it can be changed into a prime (10572122021) 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, 24206 + ... + 147411.
It is an arithmetic number, because the mean of its divisors is an integer number (2643088818).
Almost surely, 210572122051 is an apocalyptic number.
10572122051 is a deficient number, since it is larger than the sum of its proper divisors (233221).
10572122051 is an equidigital number, since it uses as much as digits as its factorization.
10572122051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233220.
The product of its (nonzero) digits is 1400, while the sum is 26.
Adding to 10572122051 its reverse (15022127501), we get a palindrome (25594249552).
The spelling of 10572122051 in words is "ten billion, five hundred seventy-two million, one hundred twenty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •