Base | Representation |
---|---|
bin | 10001101000110001100… |
… | …100011110100010100011 |
3 | 11021212102020012102221021 |
4 | 101220301210132202203 |
5 | 124324200140021311 |
6 | 2324442452310311 |
7 | 153364540421263 |
oct | 21506144364243 |
9 | 4255366172837 |
10 | 1212012423331 |
11 | 428014463586 |
12 | 176a90612397 |
13 | 8a3a51ac0c8 |
14 | 42939a5b7a3 |
15 | 217d95b2171 |
hex | 11a3191e8a3 |
1212012423331 has 8 divisors (see below), whose sum is σ = 1253997193680. Its totient is φ = 1170040402272.
The previous prime is 1212012423319. The next prime is 1212012423353. The reversal of 1212012423331 is 1333242102121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1212012423331 - 235 = 1177652684963 is a prime.
It is a super-2 number, since 2×12120124233312 (a number of 25 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 = 1212012423296 and 1212012423305.
It is not an unprimeable number, because it can be changed into a prime (1212012423371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2993700 + ... + 3374353.
It is an arithmetic number, because the mean of its divisors is an integer number (156749649210).
Almost surely, 21212012423331 is an apocalyptic number.
1212012423331 is a deficient number, since it is larger than the sum of its proper divisors (41984770349).
1212012423331 is an equidigital number, since it uses as much as digits as its factorization.
1212012423331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6374645.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1212012423331 its reverse (1333242102121), we get a palindrome (2545254525452).
The spelling of 1212012423331 in words is "one trillion, two hundred twelve billion, twelve million, four hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •