Base | Representation |
---|---|
bin | 110111111110110111… |
… | …1111101000000111001 |
3 | 102111022102122000000111 |
4 | 1233331233331000321 |
5 | 3432203124321241 |
6 | 131121240104321 |
7 | 11454124246621 |
oct | 1577557750071 |
9 | 374272560014 |
10 | 120221323321 |
11 | 46a92891660 |
12 | 1b371a650a1 |
13 | b44bcc9208 |
14 | 5b668b9881 |
15 | 31d9622c81 |
hex | 1bfdbfd039 |
120221323321 has 8 divisors (see below), whose sum is σ = 131437521504. Its totient is φ = 109052956320.
The previous prime is 120221323253. The next prime is 120221323351. The reversal of 120221323321 is 123323122021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120221323321 - 219 = 120220799033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120221323292 and 120221323301.
It is not an unprimeable number, because it can be changed into a prime (120221323351) 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, 11952535 + ... + 11962588.
It is an arithmetic number, because the mean of its divisors is an integer number (16429690188).
Almost surely, 2120221323321 is an apocalyptic number.
120221323321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120221323321 is a deficient number, since it is larger than the sum of its proper divisors (11216198183).
120221323321 is a wasteful number, since it uses less digits than its factorization.
120221323321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23915591.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 120221323321 its reverse (123323122021), we get a palindrome (243544445342).
The spelling of 120221323321 in words is "one hundred twenty billion, two hundred twenty-one million, three hundred twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •