Base | Representation |
---|---|
bin | 101101011010110001011… |
… | …001010010011010010101 |
3 | 102001101011101112102012010 |
4 | 231122301121102122111 |
5 | 402114024322000031 |
6 | 10345453542014433 |
7 | 441331216056450 |
oct | 55326131223225 |
9 | 12041141472163 |
10 | 3121122453141 |
11 | aa372a291520 |
12 | 424a89717419 |
13 | 198422429b14 |
14 | ab0c5344497 |
15 | 562c3018246 |
hex | 2d6b1652695 |
3121122453141 has 64 divisors (see below), whose sum is σ = 5272960536576. Its totient is φ = 1595024524800.
The previous prime is 3121122453131. The next prime is 3121122453149. The reversal of 3121122453141 is 1413542211213.
3121122453141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3121122453141 - 25 = 3121122453109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3121122453099 and 3121122453108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3121122453149) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7287051 + ... + 7703463.
It is an arithmetic number, because the mean of its divisors is an integer number (82390008384).
Almost surely, 23121122453141 is an apocalyptic number.
It is an amenable number.
3121122453141 is a deficient number, since it is larger than the sum of its proper divisors (2151838083435).
3121122453141 is a wasteful number, since it uses less digits than its factorization.
3121122453141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416962.
The product of its digits is 5760, while the sum is 30.
Adding to 3121122453141 its reverse (1413542211213), we get a palindrome (4534664664354).
The spelling of 3121122453141 in words is "three trillion, one hundred twenty-one billion, one hundred twenty-two million, four hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •