Base | Representation |
---|---|
bin | 1001001101000100011001… |
… | …0110000010010111000011 |
3 | 1022211110210210002120202111 |
4 | 2103101012112002113003 |
5 | 2311302003010200311 |
6 | 33305042000400151 |
7 | 2063104041202213 |
oct | 223210626022703 |
9 | 38743723076674 |
10 | 10120123131331 |
11 | 3251a13749574 |
12 | 1175420916057 |
13 | 5854289c4b65 |
14 | 26db60968243 |
15 | 1283aab1bd21 |
hex | 934465825c3 |
10120123131331 has 4 divisors (see below), whose sum is σ = 10129086926200. Its totient is φ = 10111159336464.
The previous prime is 10120123131323. The next prime is 10120123131353. The reversal of 10120123131331 is 13313132102101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10120123131331 - 23 = 10120123131323 is a prime.
It is a super-2 number, since 2×101201231313312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10120123131731) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4481895741 + ... + 4481897998.
It is an arithmetic number, because the mean of its divisors is an integer number (2532271731550).
Almost surely, 210120123131331 is an apocalyptic number.
10120123131331 is a deficient number, since it is larger than the sum of its proper divisors (8963794869).
10120123131331 is an equidigital number, since it uses as much as digits as its factorization.
10120123131331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8963794868.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 10120123131331 its reverse (13313132102101), we get a palindrome (23433255233432).
The spelling of 10120123131331 in words is "ten trillion, one hundred twenty billion, one hundred twenty-three million, one hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •