Base | Representation |
---|---|
bin | 11011110001000101010011… |
… | …110011000001011000101000 |
3 | 121000101120121110211222020100 |
4 | 123301011103303001120220 |
5 | 112001304143004323422 |
6 | 1111421130033025400 |
7 | 34502615446342326 |
oct | 3361052363013050 |
9 | 530346543758210 |
10 | 122120211011112 |
11 | 35a029884a2966 |
12 | 1184386b6b5260 |
13 | 531ab6a7b9542 |
14 | 2222914cb2d16 |
15 | e1b960dba7ac |
hex | 6f1153cc1628 |
122120211011112 has 48 divisors (see below), whose sum is σ = 331399777494240. Its totient is φ = 40625809085088.
The previous prime is 122120211011107. The next prime is 122120211011171. The reversal of 122120211011112 is 211110112021221.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1685961838 + ... + 1686034269.
It is an arithmetic number, because the mean of its divisors is an integer number (6904162031130).
Almost surely, 2122120211011112 is an apocalyptic number.
122120211011112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
122120211011112 is an abundant number, since it is smaller than the sum of its proper divisors (209279566483128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122120211011112 is a wasteful number, since it uses less digits than its factorization.
122120211011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3371996622 (or 3371996615 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 122120211011112 its reverse (211110112021221), we get a palindrome (333230323032333).
The spelling of 122120211011112 in words is "one hundred twenty-two trillion, one hundred twenty billion, two hundred eleven million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •