Base | Representation |
---|---|
bin | 101101111100000111100111… |
… | …000111101011001111000011 |
3 | 222111101011102022102211020110 |
4 | 231330013213013223033003 |
5 | 202440234423113321011 |
6 | 1553413250002242403 |
7 | 60362104434616452 |
oct | 5574074707531703 |
9 | 874334368384213 |
10 | 202043434120131 |
11 | 5941715933248a |
12 | 1a7b1455356403 |
13 | 88977ca1b6a46 |
14 | 37c6d50bb0b99 |
15 | 185593029aba6 |
hex | b7c1e71eb3c3 |
202043434120131 has 8 divisors (see below), whose sum is σ = 269391328226064. Its totient is φ = 134695581380480.
The previous prime is 202043434120079. The next prime is 202043434120247. The reversal of 202043434120131 is 131021434340202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 202043434120131 - 242 = 197645387609027 is a prime.
It is a super-2 number, since 2×2020434341201312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (202043434124131) 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, 3828871 + ... + 20463311.
It is an arithmetic number, because the mean of its divisors is an integer number (33673916028258).
Almost surely, 2202043434120131 is an apocalyptic number.
202043434120131 is a deficient number, since it is larger than the sum of its proper divisors (67347894105933).
202043434120131 is a wasteful number, since it uses less digits than its factorization.
202043434120131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20683141.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 202043434120131 its reverse (131021434340202), we get a palindrome (333064868460333).
The spelling of 202043434120131 in words is "two hundred two trillion, forty-three billion, four hundred thirty-four million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •