Base | Representation |
---|---|
bin | 111110100110101111001… |
… | …010011101111011011001 |
3 | 120020021201210020010200000 |
4 | 332212233022131323121 |
5 | 1030441401430120441 |
6 | 13052223122403213 |
7 | 622552360203654 |
oct | 76465712357331 |
9 | 16207653203600 |
10 | 4302201020121 |
11 | 140960a354964 |
12 | 595966500509 |
13 | 2529079250c4 |
14 | 10c32890689b |
15 | 76d9b9d82b6 |
hex | 3e9af29ded9 |
4302201020121 has 24 divisors (see below), whose sum is σ = 6455896093920. Its totient is φ = 2863039545792.
The previous prime is 4302201020093. The next prime is 4302201020123. The reversal of 4302201020121 is 1210201022034.
It is a happy number.
4302201020121 is a `hidden beast` number, since 430 + 2 + 2 + 0 + 10 + 201 + 21 = 666.
It is not a de Polignac number, because 4302201020121 - 27 = 4302201019993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4302201020094 and 4302201020103.
It is not an unprimeable number, because it can be changed into a prime (4302201020123) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15586576 + ... + 15860193.
It is an arithmetic number, because the mean of its divisors is an integer number (268995670580).
Almost surely, 24302201020121 is an apocalyptic number.
It is an amenable number.
4302201020121 is a deficient number, since it is larger than the sum of its proper divisors (2153695073799).
4302201020121 is an equidigital number, since it uses as much as digits as its factorization.
4302201020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31447347 (or 31447335 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 4302201020121 its reverse (1210201022034), we get a palindrome (5512402042155).
The spelling of 4302201020121 in words is "four trillion, three hundred two billion, two hundred one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •