Base | Representation |
---|---|
bin | 1001010110010011001… |
… | …10111111010100001101 |
3 | 1010201002200022201221101 |
4 | 10223021212333110031 |
5 | 20230314231134013 |
6 | 403321205303101 |
7 | 32130612062551 |
oct | 4531146772415 |
9 | 1121080281841 |
10 | 321210021133 |
11 | 114251757091 |
12 | 52304704a91 |
13 | 243a00c9081 |
14 | 11792005861 |
15 | 854e7948dd |
hex | 4ac99bf50d |
321210021133 has 4 divisors (see below), whose sum is σ = 323337239968. Its totient is φ = 319082802300.
The previous prime is 321210021071. The next prime is 321210021157. The reversal of 321210021133 is 331120012123.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 321210021133 - 217 = 321209890061 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 321210021133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321210031133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1063609191 + ... + 1063609492.
It is an arithmetic number, because the mean of its divisors is an integer number (80834309992).
Almost surely, 2321210021133 is an apocalyptic number.
It is an amenable number.
321210021133 is a deficient number, since it is larger than the sum of its proper divisors (2127218835).
321210021133 is a wasteful number, since it uses less digits than its factorization.
321210021133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2127218834.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 321210021133 its reverse (331120012123), we get a palindrome (652330033256).
The spelling of 321210021133 in words is "three hundred twenty-one billion, two hundred ten million, twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •