Base | Representation |
---|---|
bin | 111111100000101… |
… | …0010101010100101 |
3 | 12111111221022012200 |
4 | 1333001102222211 |
5 | 13331021420104 |
6 | 551243405113 |
7 | 103544404161 |
oct | 17701225245 |
9 | 5444838180 |
10 | 2131045029 |
11 | 9a3a12743 |
12 | 4b5823799 |
13 | 27c66a6b9 |
14 | 16304bca1 |
15 | c714ab39 |
hex | 7f052aa5 |
2131045029 has 12 divisors (see below), whose sum is σ = 3082731756. Its totient is φ = 1418594112.
The previous prime is 2131045027. The next prime is 2131045043. The reversal of 2131045029 is 9205401312.
It can be written as a sum of positive squares in 2 ways, for example, as 2076624900 + 54420129 = 45570^2 + 7377^2 .
It is not a de Polignac number, because 2131045029 - 21 = 2131045027 is a prime.
It is a super-2 number, since 2×21310450292 = 9082705831251221682, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2131044993 and 2131045011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131045027) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 168784 + ... + 180969.
It is an arithmetic number, because the mean of its divisors is an integer number (256894313).
Almost surely, 22131045029 is an apocalyptic number.
It is an amenable number.
2131045029 is a deficient number, since it is larger than the sum of its proper divisors (951686727).
2131045029 is a wasteful number, since it uses less digits than its factorization.
2131045029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 350436 (or 350433 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 2131045029 is about 46163.2432677774. The cubic root of 2131045029 is about 1286.8587369835.
The spelling of 2131045029 in words is "two billion, one hundred thirty-one million, forty-five thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •