Base | Representation |
---|---|
bin | 1011000001000001100101… |
… | …0011011110010111011001 |
3 | 1120212220210021222012010022 |
4 | 2300100121103132113121 |
5 | 3041421322432411413 |
6 | 41432141022000225 |
7 | 2360036256632036 |
oct | 260203123362731 |
9 | 46786707865108 |
10 | 12112232310233 |
11 | 394a850412700 |
12 | 1437522116075 |
13 | 69b242521803 |
14 | 2dc34145038d |
15 | 160100eb8608 |
hex | b04194de5d9 |
12112232310233 has 6 divisors (see below), whose sum is σ = 13313445432042. Its totient is φ = 11011120281920.
The previous prime is 12112232310221. The next prime is 12112232310271. The reversal of 12112232310233 is 33201323221121.
It can be written as a sum of positive squares in only one way, i.e., 8590274460889 + 3521957849344 = 2930917^2 + 1876688^2 .
It is not a de Polignac number, because 12112232310233 - 220 = 12112231261657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12112232310293) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 50050546616 + ... + 50050546857.
It is an arithmetic number, because the mean of its divisors is an integer number (2218907572007).
Almost surely, 212112232310233 is an apocalyptic number.
It is an amenable number.
12112232310233 is a deficient number, since it is larger than the sum of its proper divisors (1201213121809).
12112232310233 is a wasteful number, since it uses less digits than its factorization.
12112232310233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100101093495 (or 100101093484 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 12112232310233 its reverse (33201323221121), we get a palindrome (45313555531354).
The spelling of 12112232310233 in words is "twelve trillion, one hundred twelve billion, two hundred thirty-two million, three hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •