Base | Representation |
---|---|
bin | 101011111110100100011… |
… | …001010111011010010001 |
3 | 101200220121202011220022221 |
4 | 223332210121113122101 |
5 | 344003300222401001 |
6 | 10232202014301041 |
7 | 431224645122511 |
oct | 53764431273221 |
9 | 11626552156287 |
10 | 3022120122001 |
11 | a65746027842 |
12 | 409859ab7781 |
13 | 18bca551c4a6 |
14 | a63b29c5841 |
15 | 5392b69e1a1 |
hex | 2bfa4657691 |
3022120122001 has 16 divisors (see below), whose sum is σ = 3125950064640. Its totient is φ = 2918691092160.
The previous prime is 3022120121983. The next prime is 3022120122017. The reversal of 3022120122001 is 1002210212203.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 3022120122001 - 213 = 3022120113809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3022120129001) 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 15 ways as a sum of consecutive naturals, for example, 41522520 + ... + 41595238.
It is an arithmetic number, because the mean of its divisors is an integer number (195371879040).
Almost surely, 23022120122001 is an apocalyptic number.
3022120122001 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3022120122001 is a deficient number, since it is larger than the sum of its proper divisors (103829942639).
3022120122001 is a wasteful number, since it uses less digits than its factorization.
3022120122001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75456.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 3022120122001 its reverse (1002210212203), we get a palindrome (4024330334204).
The spelling of 3022120122001 in words is "three trillion, twenty-two billion, one hundred twenty million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •