Base | Representation |
---|---|
bin | 101101100001010011101111… |
… | …010010100100010100010010 |
3 | 222020212000212000110111111202 |
4 | 231201103233102210110102 |
5 | 202220043202214114442 |
6 | 1545443030020511202 |
7 | 60112022106110465 |
oct | 5541235722442422 |
9 | 866760760414452 |
10 | 200201030223122 |
11 | 58876864370415 |
12 | 1a554373b4b502 |
13 | 8792b50b6a926 |
14 | 3761ad287d2dc |
15 | 1822a4cbb4c32 |
hex | b614ef4a4512 |
200201030223122 has 16 divisors (see below), whose sum is σ = 306721497398400. Its totient is φ = 97960955499888.
The previous prime is 200201030223109. The next prime is 200201030223143. The reversal of 200201030223122 is 221322030102002.
It is a happy number.
200201030223122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2002010302231222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200201030223094 and 200201030223103.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 105153872 + ... + 107040827.
It is an arithmetic number, because the mean of its divisors is an integer number (19170093587400).
Almost surely, 2200201030223122 is an apocalyptic number.
200201030223122 is a deficient number, since it is larger than the sum of its proper divisors (106520467175278).
200201030223122 is a wasteful number, since it uses less digits than its factorization.
200201030223122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212204785.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 200201030223122 its reverse (221322030102002), we get a palindrome (421523060325124).
The spelling of 200201030223122 in words is "two hundred trillion, two hundred one billion, thirty million, two hundred twenty-three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •