Base | Representation |
---|---|
bin | 1010111100010011110000… |
… | …1000101010110000010101 |
3 | 1120121011122212112021221221 |
4 | 2233010330020222300111 |
5 | 3034104410322120313 |
6 | 41331021310010341 |
7 | 2351140441132411 |
oct | 257047410526025 |
9 | 46534585467857 |
10 | 12031212301333 |
11 | 3919454766865 |
12 | 14238907a69b1 |
13 | 6936ccc95344 |
14 | 2d8457039d41 |
15 | 15ce5d1b4c8d |
hex | af13c22ac15 |
12031212301333 has 2 divisors, whose sum is σ = 12031212301334. Its totient is φ = 12031212301332.
The previous prime is 12031212301307. The next prime is 12031212301337. The reversal of 12031212301333 is 33310321213021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11995021804689 + 36190496644 = 3463383^2 + 190238^2 .
It is a cyclic number.
It is not a de Polignac number, because 12031212301333 - 241 = 9832189045781 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12031212301298 and 12031212301307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12031212301337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6015606150666 + 6015606150667.
It is an arithmetic number, because the mean of its divisors is an integer number (6015606150667).
Almost surely, 212031212301333 is an apocalyptic number.
It is an amenable number.
12031212301333 is a deficient number, since it is larger than the sum of its proper divisors (1).
12031212301333 is an equidigital number, since it uses as much as digits as its factorization.
12031212301333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 12031212301333 its reverse (33310321213021), we get a palindrome (45341533514354).
The spelling of 12031212301333 in words is "twelve trillion, thirty-one billion, two hundred twelve million, three hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •