Base | Representation |
---|---|
bin | 110001111110010010111… |
… | …100001110100000110010 |
3 | 110011022010102001012222220 |
4 | 301332102330032200302 |
5 | 422231111344143442 |
6 | 11145342442541510 |
7 | 503052202324635 |
oct | 61762274164062 |
9 | 13138112035886 |
10 | 3434144131122 |
11 | 110445991a161 |
12 | 475687b07896 |
13 | 1bbab8c7a513 |
14 | bc2dba55c1c |
15 | 5e4e39abeec |
hex | 31f92f0e832 |
3434144131122 has 16 divisors (see below), whose sum is σ = 6868318154880. Its totient is φ = 1144709728272.
The previous prime is 3434144131091. The next prime is 3434144131127. The reversal of 3434144131122 is 2211314414343.
It is a happy number.
3434144131122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (3434144131127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 419079 + ... + 2654037.
It is an arithmetic number, because the mean of its divisors is an integer number (429269884680).
Almost surely, 23434144131122 is an apocalyptic number.
3434144131122 is an abundant number, since it is smaller than the sum of its proper divisors (3434174023758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3434144131122 is a wasteful number, since it uses less digits than its factorization.
3434144131122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2491057.
The product of its digits is 27648, while the sum is 33.
Adding to 3434144131122 its reverse (2211314414343), we get a palindrome (5645458545465).
It can be divided in two parts, 343414 and 4131122, that added together give a triangular number (4474536 = T2991).
The spelling of 3434144131122 in words is "three trillion, four hundred thirty-four billion, one hundred forty-four million, one hundred thirty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •