Base | Representation |
---|---|
bin | 1011110010000000001… |
… | …0111011100010111110 |
3 | 201100102200101022020122 |
4 | 2330200002323202332 |
5 | 11304004140231024 |
6 | 232552022014542 |
7 | 20423454660266 |
oct | 2744002734276 |
9 | 640380338218 |
10 | 202401102014 |
11 | 78924166731 |
12 | 33287877452 |
13 | 161179025b7 |
14 | 9b20d4a7a6 |
15 | 53e9166d5e |
hex | 2f200bb8be |
202401102014 has 8 divisors (see below), whose sum is σ = 307444712160. Its totient is φ = 99919531296.
The previous prime is 202401102011. The next prime is 202401102031. The reversal of 202401102014 is 410201104202.
202401102014 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 202401101983 and 202401102001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202401102011) 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 3 ways as a sum of consecutive naturals, for example, 640509659 + ... + 640509974.
It is an arithmetic number, because the mean of its divisors is an integer number (38430589020).
Almost surely, 2202401102014 is an apocalyptic number.
202401102014 is a deficient number, since it is larger than the sum of its proper divisors (105043610146).
202401102014 is a wasteful number, since it uses less digits than its factorization.
202401102014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1281019714.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 202401102014 its reverse (410201104202), we get a palindrome (612602206216).
The spelling of 202401102014 in words is "two hundred two billion, four hundred one million, one hundred two thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •