Base | Representation |
---|---|
bin | 1111111110101101011000… |
… | …11110110111011111000001 |
3 | 11121102100112111102220211001 |
4 | 13333112230132313133001 |
5 | 14101213230413040223 |
6 | 202423034120252001 |
7 | 10254532325034361 |
oct | 777265436673701 |
9 | 147370474386731 |
10 | 35140021221313 |
11 | 10218887976628 |
12 | 3b36456011001 |
13 | 167b8c75b5798 |
14 | 896b010c69a1 |
15 | 40e11500e9ad |
hex | 1ff5ac7b77c1 |
35140021221313 has 8 divisors (see below), whose sum is σ = 35394342984000. Its totient is φ = 34885721113968.
The previous prime is 35140021221307. The next prime is 35140021221379. The reversal of 35140021221313 is 31312212004153.
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 35140021221313 - 229 = 35139484350401 is a prime.
It is a super-3 number, since 3×351400212213133 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (35140021221913) 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, 2149606 + ... + 8654527.
It is an arithmetic number, because the mean of its divisors is an integer number (4424292873000).
Almost surely, 235140021221313 is an apocalyptic number.
It is an amenable number.
35140021221313 is a deficient number, since it is larger than the sum of its proper divisors (254321762687).
35140021221313 is a wasteful number, since it uses less digits than its factorization.
35140021221313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10827671.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 35140021221313 its reverse (31312212004153), we get a palindrome (66452233225466).
The spelling of 35140021221313 in words is "thirty-five trillion, one hundred forty billion, twenty-one million, two hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •