Base | Representation |
---|---|
bin | 1100011100000… |
… | …11000110100111 |
3 | 21021100022211112 |
4 | 12032003012213 |
5 | 203203033043 |
6 | 14204255235 |
7 | 2404632545 |
oct | 616030647 |
9 | 237308745 |
10 | 104346023 |
11 | 5399a791 |
12 | 2ab4151b |
13 | 18805a12 |
14 | dc02d95 |
15 | 9262518 |
hex | 63831a7 |
104346023 has 8 divisors (see below), whose sum is σ = 105936768. Its totient is φ = 102763384.
The previous prime is 104346007. The next prime is 104346071. The reversal of 104346023 is 320643401.
It is a happy number.
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 104346023 - 24 = 104346007 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 104346023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104346083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26990 + ... + 30612.
It is an arithmetic number, because the mean of its divisors is an integer number (13242096).
Almost surely, 2104346023 is an apocalyptic number.
104346023 is a deficient number, since it is larger than the sum of its proper divisors (1590745).
104346023 is an equidigital number, since it uses as much as digits as its factorization.
104346023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4053.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 104346023 is about 10214.9901125748. The cubic root of 104346023 is about 470.7879088312.
Adding to 104346023 its reverse (320643401), we get a palindrome (424989424).
The spelling of 104346023 in words is "one hundred four million, three hundred forty-six thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •