Base | Representation |
---|---|
bin | 11011010101100110000011… |
… | …110100001011010101010011 |
3 | 120202200222211012201102020210 |
4 | 123111212003310023111103 |
5 | 111224332030114311011 |
6 | 1103413244235535203 |
7 | 34216263662301633 |
oct | 3325460364132523 |
9 | 522628735642223 |
10 | 120231231010131 |
11 | 3534486253558a |
12 | 1159974bbba503 |
13 | 52119aab720a7 |
14 | 2199318c7c6c3 |
15 | dd77548176a6 |
hex | 6d5983d0b553 |
120231231010131 has 64 divisors (see below), whose sum is σ = 173490056064000. Its totient is φ = 73834427842560.
The previous prime is 120231231010109. The next prime is 120231231010141. The reversal of 120231231010131 is 131010132132021.
It is not a de Polignac number, because 120231231010131 - 214 = 120231230993747 is a prime.
It is a super-2 number, since 2×1202312310101312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120231231010098 and 120231231010107.
It is not an unprimeable number, because it can be changed into a prime (120231231010141) 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, 139682131 + ... + 140540243.
It is an arithmetic number, because the mean of its divisors is an integer number (2710782126000).
Almost surely, 2120231231010131 is an apocalyptic number.
120231231010131 is a deficient number, since it is larger than the sum of its proper divisors (53258825053869).
120231231010131 is a wasteful number, since it uses less digits than its factorization.
120231231010131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 858684.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 120231231010131 its reverse (131010132132021), we get a palindrome (251241363142152).
The spelling of 120231231010131 in words is "one hundred twenty trillion, two hundred thirty-one billion, two hundred thirty-one million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •