Base | Representation |
---|---|
bin | 11000010101010001110… |
… | …100110010100011101101 |
3 | 12220212000120111200002201 |
4 | 120111101310302203231 |
5 | 204343442424234323 |
6 | 3320054205021501 |
7 | 231543366411046 |
oct | 30252164624355 |
9 | 5825016450081 |
10 | 1672115071213 |
11 | 59515a4028a4 |
12 | 230097b54891 |
13 | c18ab607402 |
14 | 5ad061938cd |
15 | 2d7677378ad |
hex | 18551d328ed |
1672115071213 has 4 divisors (see below), whose sum is σ = 1672141528188. Its totient is φ = 1672088614240.
The previous prime is 1672115071183. The next prime is 1672115071217. The reversal of 1672115071213 is 3121705112761.
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 1042191890884 + 629923180329 = 1020878^2 + 793677^2 .
It is a cyclic number.
It is not a de Polignac number, because 1672115071213 - 229 = 1671578200301 is a prime.
It is a super-2 number, since 2×16721150712132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1672115071217) 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, 13133458 + ... + 13260163.
It is an arithmetic number, because the mean of its divisors is an integer number (418035382047).
Almost surely, 21672115071213 is an apocalyptic number.
It is an amenable number.
1672115071213 is a deficient number, since it is larger than the sum of its proper divisors (26456975).
1672115071213 is an equidigital number, since it uses as much as digits as its factorization.
1672115071213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26456974.
The product of its (nonzero) digits is 17640, while the sum is 37.
The spelling of 1672115071213 in words is "one trillion, six hundred seventy-two billion, one hundred fifteen million, seventy-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •