Base | Representation |
---|---|
bin | 1001100000010010011… |
… | …01111110001100010100 |
3 | 1011012221101011020011120 |
4 | 10300021031332030110 |
5 | 20322304434001202 |
6 | 410005235003540 |
7 | 32410522442610 |
oct | 4601115761424 |
9 | 1135841136146 |
10 | 326572172052 |
11 | 116553528475 |
12 | 533604395b0 |
13 | 24a45ca6739 |
14 | 11b40218340 |
15 | 87653d50bc |
hex | 4c0937e314 |
326572172052 has 24 divisors (see below), whose sum is σ = 870859125696. Its totient is φ = 93306334848.
The previous prime is 326572172033. The next prime is 326572172149. The reversal of 326572172052 is 250271275623.
It is a super-2 number, since 2×3265721720522 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 326572171995 and 326572172013.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1943881893 + ... + 1943882060.
It is an arithmetic number, because the mean of its divisors is an integer number (36285796904).
Almost surely, 2326572172052 is an apocalyptic number.
It is an amenable number.
326572172052 is an abundant number, since it is smaller than the sum of its proper divisors (544286953644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326572172052 is a wasteful number, since it uses less digits than its factorization.
326572172052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3887763967 (or 3887763965 counting only the distinct ones).
The product of its (nonzero) digits is 352800, while the sum is 42.
The spelling of 326572172052 in words is "three hundred twenty-six billion, five hundred seventy-two million, one hundred seventy-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •