Base | Representation |
---|---|
bin | 11101000111000011111… |
… | …00110111011110010011 |
3 | 10112121202021111022010010 |
4 | 32203201330313132103 |
5 | 112341424122222011 |
6 | 2043255103210003 |
7 | 132156315164511 |
oct | 16434174673623 |
9 | 3477667438103 |
10 | 1000223242131 |
11 | 356212a43023 |
12 | 141a248a6903 |
13 | 734225ccb89 |
14 | 365a7d594b1 |
15 | 1b0411621a6 |
hex | e8e1f37793 |
1000223242131 has 8 divisors (see below), whose sum is σ = 1342462983424. Its totient is φ = 662399497800.
The previous prime is 1000223242129. The next prime is 1000223242141. The reversal of 1000223242131 is 1312423220001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1000223242131 - 21 = 1000223242129 is a prime.
It is a super-2 number, since 2×10002232421312 (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 = 1000223242098 and 1000223242107.
It is not an unprimeable number, because it can be changed into a prime (1000223242111) 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, 1103998711 + ... + 1103999616.
It is an arithmetic number, because the mean of its divisors is an integer number (167807872928).
Almost surely, 21000223242131 is an apocalyptic number.
1000223242131 is a deficient number, since it is larger than the sum of its proper divisors (342239741293).
1000223242131 is a wasteful number, since it uses less digits than its factorization.
1000223242131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2207998481.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1000223242131 its reverse (1312423220001), we get a palindrome (2312646462132).
The spelling of 1000223242131 in words is "one trillion, two hundred twenty-three million, two hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •