Base | Representation |
---|---|
bin | 11101110111001000111110… |
… | …010000101100011111001001 |
3 | 122020000021021112110202211202 |
4 | 131313020332100230133021 |
5 | 114203223032430303001 |
6 | 1143153202002233545 |
7 | 36443315063340332 |
oct | 3567107620543711 |
9 | 566007245422752 |
10 | 131332554541001 |
11 | 38934907229960 |
12 | 128911669558b5 |
13 | 58387b705c128 |
14 | 246075b15d289 |
15 | 102b3db4e896b |
hex | 77723e42c7c9 |
131332554541001 has 8 divisors (see below), whose sum is σ = 143284611962208. Its totient is φ = 119382619500000.
The previous prime is 131332554540997. The next prime is 131332554541009. The reversal of 131332554541001 is 100145455233131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131332554541001 - 22 = 131332554540997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (131332554541009) 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, 530465660 + ... + 530713181.
It is an arithmetic number, because the mean of its divisors is an integer number (17910576495276).
Almost surely, 2131332554541001 is an apocalyptic number.
131332554541001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131332554541001 is a deficient number, since it is larger than the sum of its proper divisors (11952057421207).
131332554541001 is a wasteful number, since it uses less digits than its factorization.
131332554541001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1061190103.
The product of its (nonzero) digits is 108000, while the sum is 38.
The spelling of 131332554541001 in words is "one hundred thirty-one trillion, three hundred thirty-two billion, five hundred fifty-four million, five hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •