Base | Representation |
---|---|
bin | 110000101001001010… |
… | …0000101101100111011 |
3 | 100222122000022122022200 |
4 | 1201102110011230323 |
5 | 3202413303304201 |
6 | 115553252521243 |
7 | 10355423106045 |
oct | 1412224055473 |
9 | 328560278280 |
10 | 104460213051 |
11 | 40335081197 |
12 | 182b3620223 |
13 | 9b0989566c |
14 | 50ad570a95 |
15 | 2ab5ab9386 |
hex | 1852505b3b |
104460213051 has 12 divisors (see below), whose sum is σ = 152582334840. Its totient is φ = 68857668000.
The previous prime is 104460213047. The next prime is 104460213073. The reversal of 104460213051 is 150312064401.
It is a happy number.
104460213051 is a `hidden beast` number, since 1 + 0 + 4 + 4 + 602 + 1 + 3 + 0 + 51 = 666.
It is not a de Polignac number, because 104460213051 - 22 = 104460213047 is a prime.
It is a super-2 number, since 2×1044602130512 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104460213001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 65205325 + ... + 65206926.
It is an arithmetic number, because the mean of its divisors is an integer number (12715194570).
Almost surely, 2104460213051 is an apocalyptic number.
104460213051 is a deficient number, since it is larger than the sum of its proper divisors (48122121789).
104460213051 is a wasteful number, since it uses less digits than its factorization.
104460213051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130412346 (or 130412343 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 104460213051 its reverse (150312064401), we get a palindrome (254772277452).
The spelling of 104460213051 in words is "one hundred four billion, four hundred sixty million, two hundred thirteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •