Base | Representation |
---|---|
bin | 10110000000001… |
… | …101000011100110 |
3 | 221201121212122211 |
4 | 112000031003212 |
5 | 1224000332410 |
6 | 100344114034 |
7 | 12101512366 |
oct | 2600150346 |
9 | 851555584 |
10 | 369152230 |
11 | 17a416597 |
12 | a376591a |
13 | 5b630795 |
14 | 370549a6 |
15 | 2261d68a |
hex | 1600d0e6 |
369152230 has 32 divisors (see below), whose sum is σ = 670965120. Its totient is φ = 146227200.
The previous prime is 369152183. The next prime is 369152243. The reversal of 369152230 is 32251963.
It is a junction number, because it is equal to n+sod(n) for n = 369152192 and 369152201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 613930 + ... + 614530.
It is an arithmetic number, because the mean of its divisors is an integer number (20967660).
Almost surely, 2369152230 is an apocalyptic number.
369152230 is a deficient number, since it is larger than the sum of its proper divisors (301812890).
369152230 is a wasteful number, since it uses less digits than its factorization.
369152230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1104.
The product of its (nonzero) digits is 9720, while the sum is 31.
The square root of 369152230 is about 19213.3346923432. The cubic root of 369152230 is about 717.3567107744.
The spelling of 369152230 in words is "three hundred sixty-nine million, one hundred fifty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •