Base | Representation |
---|---|
bin | 1001010110010101100… |
… | …11010000001011001100 |
3 | 1010201011001221102210210 |
4 | 10223022303100023030 |
5 | 20230334340410012 |
6 | 403323202002420 |
7 | 32131244026350 |
oct | 4531263201314 |
9 | 1121131842723 |
10 | 321230013132 |
11 | 114261a713a6 |
12 | 5230b346410 |
13 | 243a42a8962 |
14 | 1179492b460 |
15 | 85513e323c |
hex | 4acacd02cc |
321230013132 has 48 divisors (see below), whose sum is σ = 872775896832. Its totient is φ = 90048304320.
The previous prime is 321230013037. The next prime is 321230013161. The reversal of 321230013132 is 231310032123.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 321230013099 and 321230013108.
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 15 ways as a sum of consecutive naturals, for example, 36072594 + ... + 36081497.
It is an arithmetic number, because the mean of its divisors is an integer number (18182831184).
Almost surely, 2321230013132 is an apocalyptic number.
It is an amenable number.
321230013132 is an abundant number, since it is smaller than the sum of its proper divisors (551545883700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321230013132 is a wasteful number, since it uses less digits than its factorization.
321230013132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72154158 (or 72154156 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 321230013132 its reverse (231310032123), we get a palindrome (552540045255).
The spelling of 321230013132 in words is "three hundred twenty-one billion, two hundred thirty million, thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •