Base | Representation |
---|---|
bin | 1001011110001110011… |
… | …00010010100110011100 |
3 | 1011010002011202100202001 |
4 | 10233013030102212130 |
5 | 20313022343410400 |
6 | 405303304212044 |
7 | 32341212024040 |
oct | 4570714224634 |
9 | 1133064670661 |
10 | 325464435100 |
11 | 116035209292 |
12 | 530b146a024 |
13 | 248ca64729c |
14 | 11a77064020 |
15 | 86ed021a6a |
hex | 4bc731299c |
325464435100 has 36 divisors (see below), whose sum is σ = 807151800784. Its totient is φ = 111587806080.
The previous prime is 325464435029. The next prime is 325464435103. The reversal of 325464435100 is 1534464523.
It is a super-2 number, since 2×3254644351002 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 325464435100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (325464435103) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 232473897 + ... + 232475296.
Almost surely, 2325464435100 is an apocalyptic number.
It is an amenable number.
325464435100 is an abundant number, since it is smaller than the sum of its proper divisors (481687365684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
325464435100 is a wasteful number, since it uses less digits than its factorization.
325464435100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464949214 (or 464949207 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 37.
Adding to 325464435100 its reverse (1534464523), we get a palindrome (326998899623).
The spelling of 325464435100 in words is "three hundred twenty-five billion, four hundred sixty-four million, four hundred thirty-five thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •