Base | Representation |
---|---|
bin | 11110000000110010000… |
… | …10110100100101101011 |
3 | 10122120201221220121210210 |
4 | 33000121002310211223 |
5 | 113343410323234011 |
6 | 2105422110512203 |
7 | 134334255050556 |
oct | 17003102644553 |
9 | 3576657817723 |
10 | 1031212321131 |
11 | 368375520813 |
12 | 147a32b05663 |
13 | 7632087a305 |
14 | 37ca78ab69d |
15 | 1bc56a116a6 |
hex | f0190b496b |
1031212321131 has 8 divisors (see below), whose sum is σ = 1374968327824. Its totient is φ = 687465597600.
The previous prime is 1031212321127. The next prime is 1031212321133. The reversal of 1031212321131 is 1311232121301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1031212321131 - 22 = 1031212321127 is a prime.
It is a super-2 number, since 2×10312123211312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1031212321098 and 1031212321107.
It is not an unprimeable number, because it can be changed into a prime (1031212321133) 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, 2057320 + ... + 2508981.
It is an arithmetic number, because the mean of its divisors is an integer number (171871040978).
Almost surely, 21031212321131 is an apocalyptic number.
1031212321131 is a deficient number, since it is larger than the sum of its proper divisors (343756006693).
1031212321131 is an equidigital number, since it uses as much as digits as its factorization.
1031212321131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4641581.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1031212321131 its reverse (1311232121301), we get a palindrome (2342444442432).
The spelling of 1031212321131 in words is "one trillion, thirty-one billion, two hundred twelve million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •