Base | Representation |
---|---|
bin | 101110111110000001101001… |
… | …0111100000100101101100111 |
3 | 2000011211021112201010111120121 |
4 | 1131330003102330010231213 |
5 | 413122432011433201020 |
6 | 4022404112534142411 |
7 | 153010513030500460 |
oct | 13574032274045547 |
9 | 2004737481114517 |
10 | 413145033100135 |
11 | 10a705908575116 |
12 | 3a4063377b1a07 |
13 | 1496b542745acb |
14 | 740447d4d7d67 |
15 | 32b6cb52cabaa |
hex | 177c0d2f04b67 |
413145033100135 has 8 divisors (see below), whose sum is σ = 566598902537376. Its totient is φ = 283299451268640.
The previous prime is 413145033100117. The next prime is 413145033100171. The reversal of 413145033100135 is 531001330541314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 413145033100135 - 25 = 413145033100103 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 413145033100135.
It is a congruent 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, 5902071901396 + ... + 5902071901465.
It is an arithmetic number, because the mean of its divisors is an integer number (70824862817172).
Almost surely, 2413145033100135 is an apocalyptic number.
413145033100135 is a deficient number, since it is larger than the sum of its proper divisors (153453869437241).
413145033100135 is a wasteful number, since it uses less digits than its factorization.
413145033100135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11804143802873.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 413145033100135 its reverse (531001330541314), we get a palindrome (944146363641449).
The spelling of 413145033100135 in words is "four hundred thirteen trillion, one hundred forty-five billion, thirty-three million, one hundred thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •