Base | Representation |
---|---|
bin | 110110001101110110011001… |
… | …000010001011001111010001 |
3 | 1011021021020111022112102020202 |
4 | 312031312121002023033101 |
5 | 222223200423303401101 |
6 | 2203044411444144545 |
7 | 101140113530512412 |
oct | 6615663102131721 |
9 | 1137236438472222 |
10 | 238446266856401 |
11 | 69a815483a4a3a |
12 | 228b0598398155 |
13 | a308504143906 |
14 | 42c4c0a415809 |
15 | 1c8780445a36b |
hex | d8dd9908b3d1 |
238446266856401 has 8 divisors (see below), whose sum is σ = 253294903905120. Its totient is φ = 223689006036288.
The previous prime is 238446266856289. The next prime is 238446266856463. The reversal of 238446266856401 is 104658662644832.
238446266856401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-238446266856401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (238446266856601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22844051771 + ... + 22844062208.
It is an arithmetic number, because the mean of its divisors is an integer number (31661862988140).
Almost surely, 2238446266856401 is an apocalyptic number.
It is an amenable number.
238446266856401 is a deficient number, since it is larger than the sum of its proper divisors (14848637048719).
238446266856401 is a wasteful number, since it uses less digits than its factorization.
238446266856401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45688114303.
The product of its (nonzero) digits is 318504960, while the sum is 65.
The spelling of 238446266856401 in words is "two hundred thirty-eight trillion, four hundred forty-six billion, two hundred sixty-six million, eight hundred fifty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •