Base | Representation |
---|---|
bin | 1001011111100111111… |
… | …11110100011011111000 |
3 | 1011012000120012221202010 |
4 | 10233303333310123320 |
5 | 20321042312444121 |
6 | 405510040005520 |
7 | 32365640305056 |
oct | 4576377643370 |
9 | 1135016187663 |
10 | 326216140536 |
11 | 116390563750 |
12 | 532811608a0 |
13 | 249ba2bb0c0 |
14 | 11b08c1b1d6 |
15 | 8744009376 |
hex | 4bf3ff46f8 |
326216140536 has 128 divisors (see below), whose sum is σ = 960122419200. Its totient is φ = 91058311680.
The previous prime is 326216140513. The next prime is 326216140577. The reversal of 326216140536 is 635041612623.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 326216140494 and 326216140503.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1544710 + ... + 1743146.
It is an arithmetic number, because the mean of its divisors is an integer number (7500956400).
Almost surely, 2326216140536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 326216140536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (480061209600).
326216140536 is an abundant number, since it is smaller than the sum of its proper divisors (633906278664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326216140536 is a wasteful number, since it uses less digits than its factorization.
326216140536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 198949 (or 198945 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 39.
The spelling of 326216140536 in words is "three hundred twenty-six billion, two hundred sixteen million, one hundred forty thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •