Base | Representation |
---|---|
bin | 1001100010000011011011111… |
… | …1100110110100000100110011 |
3 | 10020221222010202021201221020012 |
4 | 2120200312333212310010303 |
5 | 1200404222304342004420 |
6 | 10334331225325405135 |
7 | 261166615254334235 |
oct | 23040667746640463 |
9 | 3227863667657205 |
10 | 670761142141235 |
11 | 1847a82260393a2 |
12 | 632920054097ab |
13 | 22a37672c24752 |
14 | bb8d02643a255 |
15 | 52830838cadc5 |
hex | 2620dbf9b4133 |
670761142141235 has 8 divisors (see below), whose sum is σ = 805345887168816. Its totient is φ = 536320569313440.
The previous prime is 670761142141229. The next prime is 670761142141243. The reversal of 670761142141235 is 532141241167076.
670761142141235 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 670761142141235 - 212 = 670761142137139 is a prime.
It is a super-2 number, since 2×6707611421412352 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36043039709 + ... + 36043058318.
It is an arithmetic number, because the mean of its divisors is an integer number (100668235896102).
Almost surely, 2670761142141235 is an apocalyptic number.
670761142141235 is a deficient number, since it is larger than the sum of its proper divisors (134584745027581).
670761142141235 is a wasteful number, since it uses less digits than its factorization.
670761142141235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72086099893.
The product of its (nonzero) digits is 1693440, while the sum is 50.
The spelling of 670761142141235 in words is "six hundred seventy trillion, seven hundred sixty-one billion, one hundred forty-two million, one hundred forty-one thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •