Base | Representation |
---|---|
bin | 110000011011110111… |
… | …0000001001010000111 |
3 | 100221110220201221212022 |
4 | 1200313232001022013 |
5 | 3201010042302401 |
6 | 115441113313355 |
7 | 10341364425215 |
oct | 1406756011207 |
9 | 327426657768 |
10 | 104014025351 |
11 | 40126229825 |
12 | 181aa10585b |
13 | 9a68301c82 |
14 | 506a1c5cb5 |
15 | 2a8b83071b |
hex | 1837b81287 |
104014025351 has 4 divisors (see below), whose sum is σ = 104025290304. Its totient is φ = 104002760400.
The previous prime is 104014025347. The next prime is 104014025369. The reversal of 104014025351 is 153520410401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 104014025351 - 22 = 104014025347 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 104014025351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104014024351) 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 3 ways as a sum of consecutive naturals, for example, 5618615 + ... + 5637096.
It is an arithmetic number, because the mean of its divisors is an integer number (26006322576).
Almost surely, 2104014025351 is an apocalyptic number.
104014025351 is a deficient number, since it is larger than the sum of its proper divisors (11264953).
104014025351 is an equidigital number, since it uses as much as digits as its factorization.
104014025351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11264952.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 104014025351 its reverse (153520410401), we get a palindrome (257534435752).
The spelling of 104014025351 in words is "one hundred four billion, fourteen million, twenty-five thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •