Base | Representation |
---|---|
bin | 111000110100001110… |
… | …0001011100010001110 |
3 | 102122221011210100012020 |
4 | 1301220130023202032 |
5 | 3444334343131110 |
6 | 132015021351010 |
7 | 11546360645502 |
oct | 1615034134216 |
9 | 378834710166 |
10 | 122011302030 |
11 | 47821221102 |
12 | 1b791408466 |
13 | b675abab07 |
14 | 5c96504302 |
15 | 329184bd70 |
hex | 1c6870b88e |
122011302030 has 32 divisors (see below), whose sum is σ = 297790300800. Its totient is φ = 31984883232.
The previous prime is 122011302001. The next prime is 122011302041. The reversal of 122011302030 is 30203110221.
122011302030 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34464700 + ... + 34468239.
It is an arithmetic number, because the mean of its divisors is an integer number (9305946900).
Almost surely, 2122011302030 is an apocalyptic number.
122011302030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122011302030 is an abundant number, since it is smaller than the sum of its proper divisors (175778998770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122011302030 is a wasteful number, since it uses less digits than its factorization.
122011302030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68933008.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 122011302030 its reverse (30203110221), we get a palindrome (152214412251).
The spelling of 122011302030 in words is "one hundred twenty-two billion, eleven million, three hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •