Base | Representation |
---|---|
bin | 101111000011001111… |
… | …0001101001111111101 |
3 | 100122210200011201212110 |
4 | 1132012132031033331 |
5 | 3123412310011331 |
6 | 114230044324233 |
7 | 10204605331002 |
oct | 1360636151775 |
9 | 318720151773 |
10 | 101040313341 |
11 | 3993a6939a0 |
12 | 176ba243679 |
13 | 96b31c2c76 |
14 | 4c672a38a9 |
15 | 2965730946 |
hex | 178678d3fd |
101040313341 has 8 divisors (see below), whose sum is σ = 146967728544. Its totient is φ = 61236553520.
The previous prime is 101040313333. The next prime is 101040313421. The reversal of 101040313341 is 143313040101.
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 101040313341 - 23 = 101040313333 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101040313301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1530913806 + ... + 1530913871.
It is an arithmetic number, because the mean of its divisors is an integer number (18370966068).
Almost surely, 2101040313341 is an apocalyptic number.
101040313341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101040313341 is a deficient number, since it is larger than the sum of its proper divisors (45927415203).
101040313341 is a wasteful number, since it uses less digits than its factorization.
101040313341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3061827691.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101040313341 its reverse (143313040101), we get a palindrome (244353353442).
The spelling of 101040313341 in words is "one hundred one billion, forty million, three hundred thirteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •