Base | Representation |
---|---|
bin | 11011010010010000110001… |
… | …110000101101000001000010 |
3 | 120201220002201010011122212222 |
4 | 123102100301300231001002 |
5 | 111212104022100213442 |
6 | 1103120132002451042 |
7 | 34163605623216503 |
oct | 3322206160550102 |
9 | 521802633148788 |
10 | 120002221101122 |
11 | 352667243a6378 |
12 | 11561299063a82 |
13 | 51c62126389a9 |
14 | 218c1d2040baa |
15 | dd17ee63e8d2 |
hex | 6d2431c2d042 |
120002221101122 has 8 divisors (see below), whose sum is σ = 180478274480400. Its totient is φ = 59842796274324.
The previous prime is 120002221101083. The next prime is 120002221101127. The reversal of 120002221101122 is 221101122200021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1200022211011223 (a number of 43 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 120002221101122.
It is not an unprimeable number, because it can be changed into a prime (120002221101127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79157137172 + ... + 79157138687.
It is an arithmetic number, because the mean of its divisors is an integer number (22559784310050).
Almost surely, 2120002221101122 is an apocalyptic number.
120002221101122 is a deficient number, since it is larger than the sum of its proper divisors (60476053379278).
120002221101122 is a wasteful number, since it uses less digits than its factorization.
120002221101122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158314276240.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 120002221101122 its reverse (221101122200021), we get a palindrome (341103343301143).
The spelling of 120002221101122 in words is "one hundred twenty trillion, two billion, two hundred twenty-one million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •