Base | Representation |
---|---|
bin | 111000011111101101… |
… | …1010100110011111111 |
3 | 102121011020000202011110 |
4 | 1300333123110303333 |
5 | 3441432220241111 |
6 | 131422441253103 |
7 | 11523334200300 |
oct | 1607733246377 |
9 | 377136022143 |
10 | 121323212031 |
11 | 474a887698a |
12 | 1b61aa94193 |
13 | b59638b778 |
14 | 5c2cd8a7a7 |
15 | 325122d5a6 |
hex | 1c3f6d4cff |
121323212031 has 24 divisors (see below), whose sum is σ = 194244939264. Its totient is φ = 67091174640.
The previous prime is 121323212029. The next prime is 121323212041. The reversal of 121323212031 is 130212323121.
It is not a de Polignac number, because 121323212031 - 21 = 121323212029 is a prime.
It is a super-2 number, since 2×1213232120312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 121323211989 and 121323212007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121323212041) 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, 13307185 + ... + 13316298.
It is an arithmetic number, because the mean of its divisors is an integer number (8093539136).
Almost surely, 2121323212031 is an apocalyptic number.
121323212031 is a deficient number, since it is larger than the sum of its proper divisors (72921727233).
121323212031 is a wasteful number, since it uses less digits than its factorization.
121323212031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26623531 (or 26623524 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 121323212031 its reverse (130212323121), we get a palindrome (251535535152).
The spelling of 121323212031 in words is "one hundred twenty-one billion, three hundred twenty-three million, two hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •