Base | Representation |
---|---|
bin | 1011001010010001000100… |
… | …1100011111100110110010 |
3 | 1121110002121210022012202102 |
4 | 2302210101030133212302 |
5 | 3102022012033140110 |
6 | 42033120232020402 |
7 | 2404360032315515 |
oct | 262442114374662 |
9 | 47402553265672 |
10 | 12271010052530 |
11 | 3a011192a7529 |
12 | 1462254531702 |
13 | 6b01c74a3008 |
14 | 305cc48bcd7c |
15 | 1642e54c05a5 |
hex | b291131f9b2 |
12271010052530 has 16 divisors (see below), whose sum is σ = 22087891897344. Its totient is φ = 4908387620400.
The previous prime is 12271010052527. The next prime is 12271010052533. The reversal of 12271010052530 is 3525001017221.
It is an interprime number because it is at equal distance from previous prime (12271010052527) and next prime (12271010052533).
It is a junction number, because it is equal to n+sod(n) for n = 12271010052493 and 12271010052502.
It is not an unprimeable number, because it can be changed into a prime (12271010052533) 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, 1362959 + ... + 5138061.
It is an arithmetic number, because the mean of its divisors is an integer number (1380493243584).
Almost surely, 212271010052530 is an apocalyptic number.
12271010052530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12271010052530 is a deficient number, since it is larger than the sum of its proper divisors (9816881844814).
12271010052530 is a wasteful number, since it uses less digits than its factorization.
12271010052530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4100161.
The product of its (nonzero) digits is 4200, while the sum is 29.
Adding to 12271010052530 its reverse (3525001017221), we get a palindrome (15796011069751).
The spelling of 12271010052530 in words is "twelve trillion, two hundred seventy-one billion, ten million, fifty-two thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •