Base | Representation |
---|---|
bin | 11111000001010100000… |
… | …111011001011101001001 |
3 | 21112210022212212100010012 |
4 | 133001110013121131021 |
5 | 234411223020113413 |
6 | 4311144002401305 |
7 | 310003612365533 |
oct | 37012407313511 |
9 | 7483285770105 |
10 | 2131715004233 |
11 | 752067600a91 |
12 | 2a5183060235 |
13 | 1260348399b9 |
14 | 75265a28853 |
15 | 3a6b66aa7a8 |
hex | 1f0541d9749 |
2131715004233 has 4 divisors (see below), whose sum is σ = 2257110004500. Its totient is φ = 2006320003968.
The previous prime is 2131715004217. The next prime is 2131715004239. The reversal of 2131715004233 is 3324005171312.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1294504644169 + 837210360064 = 1137763^2 + 914992^2 .
It is a cyclic number.
It is not a de Polignac number, because 2131715004233 - 24 = 2131715004217 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2131715004233.
It is not an unprimeable number, because it can be changed into a prime (2131715004239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62697500108 + ... + 62697500141.
It is an arithmetic number, because the mean of its divisors is an integer number (564277501125).
Almost surely, 22131715004233 is an apocalyptic number.
It is an amenable number.
2131715004233 is a deficient number, since it is larger than the sum of its proper divisors (125395000267).
2131715004233 is a wasteful number, since it uses less digits than its factorization.
2131715004233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125395000266.
The product of its (nonzero) digits is 15120, while the sum is 32.
The spelling of 2131715004233 in words is "two trillion, one hundred thirty-one billion, seven hundred fifteen million, four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •