Base | Representation |
---|---|
bin | 101011111110100101000… |
… | …010111100011000010100 |
3 | 101200220122111200122101212 |
4 | 223332211002330120110 |
5 | 344003311020140312 |
6 | 10232203044040552 |
7 | 431225136556133 |
oct | 53764502743024 |
9 | 11626574618355 |
10 | 3022131021332 |
11 | a657511a1655 |
12 | 409861693158 |
13 | 18bca78674b7 |
14 | a63b422191a |
15 | 5392c603822 |
hex | 2bfa50bc614 |
3022131021332 has 6 divisors (see below), whose sum is σ = 5288729287338. Its totient is φ = 1511065510664.
The previous prime is 3022131021313. The next prime is 3022131021383. The reversal of 3022131021332 is 2331201312203.
3022131021332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 2870191658896 + 151939362436 = 1694164^2 + 389794^2 .
It is a junction number, because it is equal to n+sod(n) for n = 3022131021298 and 3022131021307.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 377766377663 + ... + 377766377670.
It is an arithmetic number, because the mean of its divisors is an integer number (881454881223).
Almost surely, 23022131021332 is an apocalyptic number.
It is an amenable number.
3022131021332 is a deficient number, since it is larger than the sum of its proper divisors (2266598266006).
3022131021332 is a wasteful number, since it uses less digits than its factorization.
3022131021332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 755532755337 (or 755532755335 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 3022131021332 its reverse (2331201312203), we get a palindrome (5353332333535).
The spelling of 3022131021332 in words is "three trillion, twenty-two billion, one hundred thirty-one million, twenty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •