Base | Representation |
---|---|
bin | 10001110011001000001… |
… | …110101011001110011011 |
3 | 11022221010000212222020110 |
4 | 101303020032223032123 |
5 | 130014432240033311 |
6 | 2333522000455403 |
7 | 154240205323116 |
oct | 21631016531633 |
9 | 4287100788213 |
10 | 1223130002331 |
11 | 4317a9aaa1a6 |
12 | 17907391a563 |
13 | 8b457593713 |
14 | 432b23b757d |
15 | 21c3a6298a6 |
hex | 11cc83ab39b |
1223130002331 has 8 divisors (see below), whose sum is σ = 1630846649344. Its totient is φ = 815416678440.
The previous prime is 1223130002317. The next prime is 1223130002333. The reversal of 1223130002331 is 1332000313221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1223130002331 - 213 = 1223129994139 is a prime.
It is a super-2 number, since 2×12231300023312 (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 = 1223130002298 and 1223130002307.
It is not an unprimeable number, because it can be changed into a prime (1223130002333) 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, 216726 + ... + 1578996.
It is an arithmetic number, because the mean of its divisors is an integer number (203855831168).
Almost surely, 21223130002331 is an apocalyptic number.
1223130002331 is a deficient number, since it is larger than the sum of its proper divisors (407716647013).
1223130002331 is a wasteful number, since it uses less digits than its factorization.
1223130002331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1661561.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1223130002331 its reverse (1332000313221), we get a palindrome (2555130315552).
The spelling of 1223130002331 in words is "one trillion, two hundred twenty-three billion, one hundred thirty million, two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •