Base | Representation |
---|---|
bin | 100101110110100… |
… | …1010000111101011 |
3 | 10021111222020121200 |
4 | 1023231022013223 |
5 | 10100123113011 |
6 | 330011135243 |
7 | 43321630245 |
oct | 11355120753 |
9 | 3244866550 |
10 | 1270129131 |
11 | 5a1a558a7 |
12 | 2b5444523 |
13 | 1731a99cb |
14 | c0987095 |
15 | 7678e856 |
hex | 4bb4a1eb |
1270129131 has 12 divisors (see below), whose sum is σ = 1835375880. Its totient is φ = 846408960.
The previous prime is 1270129127. The next prime is 1270129169. The reversal of 1270129131 is 1319210721.
It is not a de Polignac number, because 1270129131 - 22 = 1270129127 is a prime.
It is a super-2 number, since 2×12701291312 = 3226456018829630322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1270129095 and 1270129104.
It is not an unprimeable number, because it can be changed into a prime (1270129121) 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 11 ways as a sum of consecutive naturals, for example, 4150 + ... + 50571.
It is an arithmetic number, because the mean of its divisors is an integer number (152947990).
Almost surely, 21270129131 is an apocalyptic number.
1270129131 is a deficient number, since it is larger than the sum of its proper divisors (565246749).
1270129131 is a wasteful number, since it uses less digits than its factorization.
1270129131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57306 (or 57303 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 27.
The square root of 1270129131 is about 35638.8710679786. The cubic root of 1270129131 is about 1082.9688350288.
Adding to 1270129131 its reverse (1319210721), we get a palindrome (2589339852).
The spelling of 1270129131 in words is "one billion, two hundred seventy million, one hundred twenty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •