Base | Representation |
---|---|
bin | 11101110100000100000011… |
… | …111110010000111000110001 |
3 | 122012021001112112011111012201 |
4 | 131310010003332100320301 |
5 | 114141242030021431304 |
6 | 1142512113515423201 |
7 | 36422121445022605 |
oct | 3564040376207061 |
9 | 565231475144181 |
10 | 131121123233329 |
11 | 38863179821049 |
12 | 1285819aa54b01 |
13 | 5821890661a98 |
14 | 2454420bb7505 |
15 | 1025b646da3a4 |
hex | 774103f90e31 |
131121123233329 has 4 divisors (see below), whose sum is σ = 131222218934884. Its totient is φ = 131020027531776.
The previous prime is 131121123233311. The next prime is 131121123233383. The reversal of 131121123233329 is 923332321121131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 98651377875600 + 32469745357729 = 9932340^2 + 5698223^2 .
It is a cyclic number.
It is not a de Polignac number, because 131121123233329 - 213 = 131121123225137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131121123233389) 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, 50547848832 + ... + 50547851425.
It is an arithmetic number, because the mean of its divisors is an integer number (32805554733721).
Almost surely, 2131121123233329 is an apocalyptic number.
It is an amenable number.
131121123233329 is a deficient number, since it is larger than the sum of its proper divisors (101095701555).
131121123233329 is a wasteful number, since it uses less digits than its factorization.
131121123233329 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101095701554.
The product of its digits is 34992, while the sum is 37.
The spelling of 131121123233329 in words is "one hundred thirty-one trillion, one hundred twenty-one billion, one hundred twenty-three million, two hundred thirty-three thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •