Base | Representation |
---|---|
bin | 110001000111110101101… |
… | …111001010110000111101 |
3 | 102221201012101121210102012 |
4 | 301013311233022300331 |
5 | 420301334030011031 |
6 | 11102432400341005 |
7 | 465612205335362 |
oct | 61076557126075 |
9 | 12851171553365 |
10 | 3375672110141 |
11 | 10916839a2381 |
12 | 466289914765 |
13 | 1b642ac5a736 |
14 | b95520aa469 |
15 | 5cc2047db2b |
hex | 311f5bcac3d |
3375672110141 has 16 divisors (see below), whose sum is σ = 3509826958848. Its totient is φ = 3243990816000.
The previous prime is 3375672110117. The next prime is 3375672110147. The reversal of 3375672110141 is 1410112765733.
It is a cyclic number.
It is not a de Polignac number, because 3375672110141 - 226 = 3375605001277 is a prime.
It is a super-2 number, since 2×33756721101412 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3375672110147) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71263721 + ... + 71311073.
It is an arithmetic number, because the mean of its divisors is an integer number (219364184928).
Almost surely, 23375672110141 is an apocalyptic number.
It is an amenable number.
3375672110141 is a deficient number, since it is larger than the sum of its proper divisors (134154848707).
3375672110141 is a wasteful number, since it uses less digits than its factorization.
3375672110141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73412.
The product of its (nonzero) digits is 105840, while the sum is 41.
Adding to 3375672110141 its reverse (1410112765733), we get a palindrome (4785784875874).
The spelling of 3375672110141 in words is "three trillion, three hundred seventy-five billion, six hundred seventy-two million, one hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •