Base | Representation |
---|---|
bin | 11101110101100001010111… |
… | …000110010101000000110001 |
3 | 122012121122010011101102001021 |
4 | 131311201113012111000301 |
5 | 114144412211314312423 |
6 | 1143030122312335441 |
7 | 36432266123254354 |
oct | 3565412706250061 |
9 | 565548104342037 |
10 | 131221302104113 |
11 | 388a1707118441 |
12 | 128736986a4581 |
13 | 582b16723b410 |
14 | 24592058ba29b |
15 | 10285794a895d |
hex | 775857195031 |
131221302104113 has 16 divisors (see below), whose sum is σ = 141357041975296. Its totient is φ = 121091538072960.
The previous prime is 131221302104099. The next prime is 131221302104131. The reversal of 131221302104113 is 311401203122131.
It is a de Polignac number, because none of the positive numbers 2k-131221302104113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131221302104143) 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, 630594781 + ... + 630802837.
It is an arithmetic number, because the mean of its divisors is an integer number (8834815123456).
Almost surely, 2131221302104113 is an apocalyptic number.
131221302104113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
131221302104113 is a deficient number, since it is larger than the sum of its proper divisors (10135739871183).
131221302104113 is a wasteful number, since it uses less digits than its factorization.
131221302104113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 222184.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 131221302104113 its reverse (311401203122131), we get a palindrome (442622505226244).
The spelling of 131221302104113 in words is "one hundred thirty-one trillion, two hundred twenty-one billion, three hundred two million, one hundred four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •