Base | Representation |
---|---|
bin | 11100011011001… |
… | …11010010000100 |
3 | 121121200111121221 |
4 | 32031213102010 |
5 | 442020343141 |
6 | 35354450124 |
7 | 5623534624 |
oct | 1615472204 |
9 | 547614557 |
10 | 238449796 |
11 | 112664952 |
12 | 67a33944 |
13 | 3a52a370 |
14 | 23950884 |
15 | 15e01bd1 |
hex | e367484 |
238449796 has 12 divisors (see below), whose sum is σ = 449386252. Its totient is φ = 110053728.
The previous prime is 238449751. The next prime is 238449797. The reversal of 238449796 is 697944832.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 50211396 + 188238400 = 7086^2 + 13720^2 .
It is a Harshad number since it is a multiple of its sum of digits (52), and also a Moran number because the ratio is a prime number: 4585573 = 238449796 / (2 + 3 + 8 + 4 + 4 + 9 + 7 + 9 + 6).
It is not an unprimeable number, because it can be changed into a prime (238449797) 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 3 ways as a sum of consecutive naturals, for example, 2292735 + ... + 2292838.
Almost surely, 2238449796 is an apocalyptic number.
238449796 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
238449796 is a deficient number, since it is larger than the sum of its proper divisors (210936456).
238449796 is a wasteful number, since it uses less digits than its factorization.
238449796 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4585590 (or 4585588 counting only the distinct ones).
The product of its digits is 2612736, while the sum is 52.
The square root of 238449796 is about 15441.8197114200. The cubic root of 238449796 is about 620.1055976918.
The spelling of 238449796 in words is "two hundred thirty-eight million, four hundred forty-nine thousand, seven hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •