Base | Representation |
---|---|
bin | 11101000111000011111… |
… | …00011100001000001001 |
3 | 10112121202021021121110121 |
4 | 32203201330130020021 |
5 | 112341424110130441 |
6 | 2043255100543241 |
7 | 132156314220115 |
oct | 16434174341011 |
9 | 3477667247417 |
10 | 1000223130121 |
11 | 356212976956 |
12 | 141a24851b21 |
13 | 73422590bb7 |
14 | 365a7d2a745 |
15 | 1b04113ddd1 |
hex | e8e1f1c209 |
1000223130121 has 12 divisors (see below), whose sum is σ = 1065872662668. Its totient is φ = 938416716032.
The previous prime is 1000223130119. The next prime is 1000223130133. The reversal of 1000223130121 is 1210313220001.
It can be written as a sum of positive squares in 6 ways, for example, as 131246798400 + 868976331721 = 362280^2 + 932189^2 .
It is not a de Polignac number, because 1000223130121 - 21 = 1000223130119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000223130095 and 1000223130104.
It is not an unprimeable number, because it can be changed into a prime (1000223130821) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5367346 + ... + 5550571.
It is an arithmetic number, because the mean of its divisors is an integer number (88822721889).
Almost surely, 21000223130121 is an apocalyptic number.
It is an amenable number.
1000223130121 is a deficient number, since it is larger than the sum of its proper divisors (65649532547).
1000223130121 is a wasteful number, since it uses less digits than its factorization.
1000223130121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10918268 (or 10918251 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1000223130121 its reverse (1210313220001), we get a palindrome (2210536350122).
The spelling of 1000223130121 in words is "one trillion, two hundred twenty-three million, one hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •