Base | Representation |
---|---|
bin | 11011010101010011011011… |
… | …001100010100011010111010 |
3 | 120202122002011202110111012110 |
4 | 123111103123030110122322 |
5 | 111224020040330320442 |
6 | 1103400134551553150 |
7 | 34214655101450430 |
oct | 3325233314243272 |
9 | 522562152414173 |
10 | 120211222120122 |
11 | 35337324a94351 |
12 | 115958a708b7b6 |
13 | 520cb3c6a3bc3 |
14 | 219837b720d50 |
15 | dd6e82de269c |
hex | 6d54db3146ba |
120211222120122 has 32 divisors (see below), whose sum is σ = 276413828124672. Its totient is φ = 34140398410224.
The previous prime is 120211222120111. The next prime is 120211222120123. The reversal of 120211222120122 is 221021222112021.
It is a super-2 number, since 2×1202112221201222 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (120211222120123) 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, 8569370098 + ... + 8569384125.
It is an arithmetic number, because the mean of its divisors is an integer number (8637932128896).
Almost surely, 2120211222120122 is an apocalyptic number.
120211222120122 is an abundant number, since it is smaller than the sum of its proper divisors (156202606004550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120211222120122 is a wasteful number, since it uses less digits than its factorization.
120211222120122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17138754402.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 120211222120122 its reverse (221021222112021), we get a palindrome (341232444232143).
The spelling of 120211222120122 in words is "one hundred twenty trillion, two hundred eleven billion, two hundred twenty-two million, one hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •