Base | Representation |
---|---|
bin | 111000011111010100… |
… | …1011000100011001110 |
3 | 102121010022101121110200 |
4 | 1300332221120203032 |
5 | 3441420342321032 |
6 | 131421252514330 |
7 | 11523115002441 |
oct | 1607651304316 |
9 | 377108347420 |
10 | 121310120142 |
11 | 474a1444842 |
12 | 1b61661b9a6 |
13 | b5937567a3 |
14 | 5c2b33d658 |
15 | 324eee447c |
hex | 1c3ea588ce |
121310120142 has 48 divisors (see below), whose sum is σ = 277090025472. Its totient is φ = 38299686480.
The previous prime is 121310120131. The next prime is 121310120147. The reversal of 121310120142 is 241021013121.
It is a super-2 number, since 2×1213101201422 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121310120147) 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 23 ways as a sum of consecutive naturals, for example, 2286558 + ... + 2339009.
It is an arithmetic number, because the mean of its divisors is an integer number (5772708864).
Almost surely, 2121310120142 is an apocalyptic number.
121310120142 is an abundant number, since it is smaller than the sum of its proper divisors (155779905330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121310120142 is a wasteful number, since it uses less digits than its factorization.
121310120142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4625653 (or 4625650 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 121310120142 its reverse (241021013121), we get a palindrome (362331133263).
The spelling of 121310120142 in words is "one hundred twenty-one billion, three hundred ten million, one hundred twenty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •