Base | Representation |
---|---|
bin | 10011100110010100… |
… | …10000001011001001 |
3 | 1000011022000002102021 |
4 | 21303022100023021 |
5 | 133022113031441 |
6 | 4500031004441 |
7 | 521513354011 |
oct | 116312201311 |
9 | 30138002367 |
10 | 10522002121 |
11 | 450a439a24 |
12 | 2057969721 |
13 | cb8ba7077 |
14 | 71b604c41 |
15 | 418b203d1 |
hex | 2732902c9 |
10522002121 has 8 divisors (see below), whose sum is σ = 10707616800. Its totient is φ = 10336630080.
The previous prime is 10522002109. The next prime is 10522002149. The reversal of 10522002121 is 12120022501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-10522002121 is a prime.
It is a super-3 number, since 3×105220021213 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10522002095 and 10522002104.
It is not an unprimeable number, because it can be changed into a prime (10522002181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27966 + ... + 147736.
It is an arithmetic number, because the mean of its divisors is an integer number (1338452100).
Almost surely, 210522002121 is an apocalyptic number.
It is an amenable number.
10522002121 is a deficient number, since it is larger than the sum of its proper divisors (185614679).
10522002121 is a wasteful number, since it uses less digits than its factorization.
10522002121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121319.
The product of its (nonzero) digits is 80, while the sum is 16.
Adding to 10522002121 its reverse (12120022501), we get a palindrome (22642024622).
The spelling of 10522002121 in words is "ten billion, five hundred twenty-two million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •