Base | Representation |
---|---|
bin | 111000010111000110… |
… | …1010001000110010011 |
3 | 102120102002102012202020 |
4 | 1300232031101012103 |
5 | 3440334241023011 |
6 | 131334041222523 |
7 | 11513225460333 |
oct | 1605615210623 |
9 | 376362365666 |
10 | 121034314131 |
11 | 4736a795695 |
12 | 1b55a191a43 |
13 | b54b57a073 |
14 | 5c028670c3 |
15 | 3235bb4006 |
hex | 1c2e351193 |
121034314131 has 16 divisors (see below), whose sum is σ = 170495884800. Its totient is φ = 76249543328.
The previous prime is 121034314087. The next prime is 121034314151. The reversal of 121034314131 is 131413430121.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 121034314131 - 26 = 121034314067 is a prime.
It is a super-2 number, since 2×1210343141312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121034314151) by changing a digit.
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, 14795901 + ... + 14804078.
It is an arithmetic number, because the mean of its divisors is an integer number (10655992800).
Almost surely, 2121034314131 is an apocalyptic number.
121034314131 is a deficient number, since it is larger than the sum of its proper divisors (49461570669).
121034314131 is a wasteful number, since it uses less digits than its factorization.
121034314131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29600058.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 121034314131 its reverse (131413430121), we get a palindrome (252447744252).
It can be divided in two parts, 12103 and 4314131, that added together give a palindrome (4326234).
The spelling of 121034314131 in words is "one hundred twenty-one billion, thirty-four million, three hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •