Base | Representation |
---|---|
bin | 11011010100001000000011… |
… | …111011001010101110111111 |
3 | 120202100100022020022022112002 |
4 | 123110020003323022232333 |
5 | 111221203324041024411 |
6 | 1103255033133532515 |
7 | 34206061564306625 |
oct | 3324100373125677 |
9 | 522310266268462 |
10 | 120130301111231 |
11 | 35305a7a2066a4 |
12 | 1158208294413b |
13 | 52053147cb018 |
14 | 21944a251b515 |
15 | dd4ce8b4733b |
hex | 6d4203ecabbf |
120130301111231 has 16 divisors (see below), whose sum is σ = 121142298816000. Its totient is φ = 119121217707168.
The previous prime is 120130301111201. The next prime is 120130301111243. The reversal of 120130301111231 is 132111103031021.
It is a cyclic number.
It is not a de Polignac number, because 120130301111231 - 234 = 120113121242047 is a prime.
It is a super-2 number, since 2×1201303011112312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120130301111201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 208624940 + ... + 209199966.
It is an arithmetic number, because the mean of its divisors is an integer number (7571393676000).
Almost surely, 2120130301111231 is an apocalyptic number.
120130301111231 is a deficient number, since it is larger than the sum of its proper divisors (1011997704769).
120130301111231 is a wasteful number, since it uses less digits than its factorization.
120130301111231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 577558.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 120130301111231 its reverse (132111103031021), we get a palindrome (252241404142252).
The spelling of 120130301111231 in words is "one hundred twenty trillion, one hundred thirty billion, three hundred one million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •