Base | Representation |
---|---|
bin | 10101110111100110… |
… | …011001010010100110 |
3 | 2020121110101012212020 |
4 | 111313212121102212 |
5 | 341042213441441 |
6 | 14442011404010 |
7 | 1460614344456 |
oct | 256746312246 |
9 | 66543335766 |
10 | 23481390246 |
11 | 9a5a6a6046 |
12 | 4673a53606 |
13 | 22a2a29872 |
14 | 11ca7dbd66 |
15 | 9266ede66 |
hex | 5779994a6 |
23481390246 has 8 divisors (see below), whose sum is σ = 46962780504. Its totient is φ = 7827130080.
The previous prime is 23481390221. The next prime is 23481390259. The reversal of 23481390246 is 64209318432.
It is a sphenic number, since it is the product of 3 distinct primes.
23481390246 is an admirable number.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 23481390198 and 23481390207.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1956782515 + ... + 1956782526.
It is an arithmetic number, because the mean of its divisors is an integer number (5870347563).
Almost surely, 223481390246 is an apocalyptic number.
23481390246 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23481390246 is a wasteful number, since it uses less digits than its factorization.
23481390246 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3913565046.
The product of its (nonzero) digits is 248832, while the sum is 42.
The spelling of 23481390246 in words is "twenty-three billion, four hundred eighty-one million, three hundred ninety thousand, two hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •