Base | Representation |
---|---|
bin | 10101101101000… |
… | …001110010010010 |
3 | 221101011111001100 |
4 | 111231001302102 |
5 | 1221204002310 |
6 | 100044245230 |
7 | 12011004612 |
oct | 2555016222 |
9 | 841144040 |
10 | 364125330 |
11 | 1775a2828 |
12 | a1b40816 |
13 | 5a59069a |
14 | 36506a42 |
15 | 21e78ec0 |
hex | 15b41c92 |
364125330 has 24 divisors (see below), whose sum is σ = 946726092. Its totient is φ = 97100064.
The previous prime is 364125263. The next prime is 364125347. The reversal of 364125330 is 33521463.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 300779649 + 63345681 = 17343^2 + 7959^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 364125294 and 364125303.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 2022829 + ... + 2023008.
Almost surely, 2364125330 is an apocalyptic number.
364125330 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
364125330 is an abundant number, since it is smaller than the sum of its proper divisors (582600762).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
364125330 is a wasteful number, since it uses less digits than its factorization.
364125330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4045850 (or 4045847 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
The square root of 364125330 is about 19082.0682841248. The cubic root of 364125330 is about 714.0856357517.
Adding to 364125330 its reverse (33521463), we get a palindrome (397646793).
The spelling of 364125330 in words is "three hundred sixty-four million, one hundred twenty-five thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •