Base | Representation |
---|---|
bin | 1001001011111001100111… |
… | …11010101000011100100010 |
3 | 2122112002222212001112201220 |
4 | 10211330303322220130202 |
5 | 10121424302130413442 |
6 | 110543444314435510 |
7 | 4153260235456224 |
oct | 445746372503442 |
9 | 78462885045656 |
10 | 20200102201122 |
11 | 64888a7093478 |
12 | 2322ab9432b96 |
13 | b36b2783753c |
14 | 4db993b44414 |
15 | 2506b7296eec |
hex | 125f33ea8722 |
20200102201122 has 8 divisors (see below), whose sum is σ = 40400204402256. Its totient is φ = 6733367400372.
The previous prime is 20200102201109. The next prime is 20200102201127. The reversal of 20200102201122 is 22110220100202.
It is a sphenic number, since it is the product of 3 distinct primes.
20200102201122 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (20200102201127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1683341850088 + ... + 1683341850099.
It is an arithmetic number, because the mean of its divisors is an integer number (5050025550282).
Almost surely, 220200102201122 is an apocalyptic number.
20200102201122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20200102201122 is a wasteful number, since it uses less digits than its factorization.
20200102201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3366683700192.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20200102201122 its reverse (22110220100202), we get a palindrome (42310322301324).
The spelling of 20200102201122 in words is "twenty trillion, two hundred billion, one hundred two million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •