Base | Representation |
---|---|
bin | 1001010110010011100… |
… | …11001010010111000111 |
3 | 1010201002220022212010110 |
4 | 10223021303022113013 |
5 | 20230321040241403 |
6 | 403321401524103 |
7 | 32130651152640 |
oct | 4531163122707 |
9 | 1121086285113 |
10 | 321213212103 |
11 | 114253536553 |
12 | 523057a3633 |
13 | 243a0975614 |
14 | 117925d66c7 |
15 | 854ebc5103 |
hex | 4ac9cca5c7 |
321213212103 has 32 divisors (see below), whose sum is σ = 490968207360. Its totient is φ = 182988495360.
The previous prime is 321213212081. The next prime is 321213212107. The reversal of 321213212103 is 301212312123.
321213212103 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 321213212103 - 25 = 321213212071 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 321213212103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321213212107) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10657551 + ... + 10687647.
It is an arithmetic number, because the mean of its divisors is an integer number (15342756480).
Almost surely, 2321213212103 is an apocalyptic number.
321213212103 is a deficient number, since it is larger than the sum of its proper divisors (169754995257).
321213212103 is a wasteful number, since it uses less digits than its factorization.
321213212103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31647.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 321213212103 its reverse (301212312123), we get a palindrome (622425524226).
The spelling of 321213212103 in words is "three hundred twenty-one billion, two hundred thirteen million, two hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •