Base | Representation |
---|---|
bin | 101011111110011111001… |
… | …001101010110011000111 |
3 | 101200220101121120222200202 |
4 | 223332133021222303013 |
5 | 344003110210333111 |
6 | 10232145152201115 |
7 | 431222526124100 |
oct | 53763711526307 |
9 | 11626347528622 |
10 | 3022032121031 |
11 | a65700391370 |
12 | 40983453919b |
13 | 18bc9021a401 |
14 | a63a50393a7 |
15 | 53923ab9b3b |
hex | 2bf9f26acc7 |
3022032121031 has 12 divisors (see below), whose sum is σ = 3835009222920. Its totient is φ = 2354830223760.
The previous prime is 3022032120977. The next prime is 3022032121051. The reversal of 3022032121031 is 1301212302203.
It is not a de Polignac number, because 3022032121031 - 218 = 3022031858887 is a prime.
It is a super-2 number, since 2×30220321210312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3022032120994 and 3022032121012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3022032121051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2803368776 + ... + 2803369853.
It is an arithmetic number, because the mean of its divisors is an integer number (319584101910).
Almost surely, 23022032121031 is an apocalyptic number.
3022032121031 is a deficient number, since it is larger than the sum of its proper divisors (812977101889).
3022032121031 is a wasteful number, since it uses less digits than its factorization.
3022032121031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5606738654 (or 5606738647 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 3022032121031 its reverse (1301212302203), we get a palindrome (4323244423234).
The spelling of 3022032121031 in words is "three trillion, twenty-two billion, thirty-two million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •