Base | Representation |
---|---|
bin | 111101000110101100… |
… | …0110110100100101010 |
3 | 110112201000200122011110 |
4 | 1322031120312210222 |
5 | 4122220101340242 |
6 | 140140540011150 |
7 | 12323532061554 |
oct | 1721530664452 |
9 | 415630618143 |
10 | 131221121322 |
11 | 507179a1705 |
12 | 21521830ab6 |
13 | c4b2b82925 |
14 | 64cb7364d4 |
15 | 363017239c |
hex | 1e8d63692a |
131221121322 has 8 divisors (see below), whose sum is σ = 262442242656. Its totient is φ = 43740373772.
The previous prime is 131221121309. The next prime is 131221121327. The reversal of 131221121322 is 223121122131.
It is a sphenic number, since it is the product of 3 distinct primes.
131221121322 is an admirable number.
It is a nude number because it is divisible by every one of its digits.
It is not an unprimeable number, because it can be changed into a prime (131221121327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10935093438 + ... + 10935093449.
It is an arithmetic number, because the mean of its divisors is an integer number (32805280332).
Almost surely, 2131221121322 is an apocalyptic number.
131221121322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131221121322 is a wasteful number, since it uses less digits than its factorization.
131221121322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21870186892.
The product of its digits is 288, while the sum is 21.
Adding to 131221121322 its reverse (223121122131), we get a palindrome (354342243453).
The spelling of 131221121322 in words is "one hundred thirty-one billion, two hundred twenty-one million, one hundred twenty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •