Base | Representation |
---|---|
bin | 1001011111100110100… |
… | …11011101101110000000 |
3 | 1011011222202100012222021 |
4 | 10233303103131232000 |
5 | 20321031323410102 |
6 | 405504542451224 |
7 | 32365436420020 |
oct | 4576323355600 |
9 | 1134882305867 |
10 | 326204513152 |
11 | 116384a41941 |
12 | 53279293b14 |
13 | 249b7a798ab |
14 | 11b07471a80 |
15 | 8742eae137 |
hex | 4bf34ddb80 |
326204513152 has 128 divisors (see below), whose sum is σ = 769021329600. Its totient is φ = 134855884800.
The previous prime is 326204513119. The next prime is 326204513177. The reversal of 326204513152 is 251315402623.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31201558 + ... + 31212010.
Almost surely, 2326204513152 is an apocalyptic number.
326204513152 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 326204513152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (384510664800).
326204513152 is an abundant number, since it is smaller than the sum of its proper divisors (442816816448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326204513152 is a wasteful number, since it uses less digits than its factorization.
326204513152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11704 (or 11692 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 326204513152 its reverse (251315402623), we get a palindrome (577519915775).
The spelling of 326204513152 in words is "three hundred twenty-six billion, two hundred four million, five hundred thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •