Base | Representation |
---|---|
bin | 1111000011011001010100… |
… | …10101000101100010000111 |
3 | 11100012112002220110120111111 |
4 | 13201230222111011202013 |
5 | 13314320420404333111 |
6 | 154222505352145451 |
7 | 6654353664021664 |
oct | 741545225054207 |
9 | 140175086416444 |
10 | 33102023121031 |
11 | a6025420a1687 |
12 | 3867488698287 |
13 | 156167995cb07 |
14 | 826209c9aa6b |
15 | 3c60d6185a21 |
hex | 1e1b2a545887 |
33102023121031 has 16 divisors (see below), whose sum is σ = 34726401034560. Its totient is φ = 31509856707840.
The previous prime is 33102023121029. The next prime is 33102023121053. The reversal of 33102023121031 is 13012132020133.
It is a cyclic number.
It is not a de Polignac number, because 33102023121031 - 21 = 33102023121029 is a prime.
It is a super-2 number, since 2×331020231210312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 33102023120993 and 33102023121011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33102023121631) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 153602851 + ... + 153818203.
It is an arithmetic number, because the mean of its divisors is an integer number (2170400064660).
Almost surely, 233102023121031 is an apocalyptic number.
33102023121031 is a deficient number, since it is larger than the sum of its proper divisors (1624377913529).
33102023121031 is a wasteful number, since it uses less digits than its factorization.
33102023121031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290106.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 33102023121031 its reverse (13012132020133), we get a palindrome (46114155141164).
The spelling of 33102023121031 in words is "thirty-three trillion, one hundred two billion, twenty-three million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •