Base | Representation |
---|---|
bin | 100101011000100000001011… |
… | …1110011101111100100101000 |
3 | 1121010021011212220102101120112 |
4 | 1022301000113303233210220 |
5 | 321044414144434400203 |
6 | 3123203124510113452 |
7 | 126155453563052045 |
oct | 11261002763574450 |
9 | 1533234786371515 |
10 | 328823095621928 |
11 | 95856101095036 |
12 | 30a681514ab888 |
13 | 11162b6708833b |
14 | 5b2b1a0b581cc |
15 | 280369b3496d8 |
hex | 12b1017cef928 |
328823095621928 has 32 divisors (see below), whose sum is σ = 653054965004160. Its totient is φ = 154682346658560.
The previous prime is 328823095621927. The next prime is 328823095621939. The reversal of 328823095621928 is 829126590328823.
It is a super-2 number, since 2×3288230956219282 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (68).
It is not an unprimeable number, because it can be changed into a prime (328823095621927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 452241926 + ... + 452968437.
It is an arithmetic number, because the mean of its divisors is an integer number (20407967656380).
Almost surely, 2328823095621928 is an apocalyptic number.
It is an amenable number.
328823095621928 is a deficient number, since it is larger than the sum of its proper divisors (324231869382232).
328823095621928 is a wasteful number, since it uses less digits than its factorization.
328823095621928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 905213057 (or 905213053 counting only the distinct ones).
The product of its (nonzero) digits is 179159040, while the sum is 68.
The spelling of 328823095621928 in words is "three hundred twenty-eight trillion, eight hundred twenty-three billion, ninety-five million, six hundred twenty-one thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •