Base | Representation |
---|---|
bin | 11101011001101110010… |
… | …11101111111001100111 |
3 | 10120120121120200220122220 |
4 | 32230313023233321213 |
5 | 113022434221004343 |
6 | 2052033240323423 |
7 | 132662524005351 |
oct | 16546713577147 |
9 | 3516546626586 |
10 | 1010243141223 |
11 | 35a494a09568 |
12 | 143960473573 |
13 | 7435b466854 |
14 | 36c789bc0d1 |
15 | 1b42ab51183 |
hex | eb372efe67 |
1010243141223 has 8 divisors (see below), whose sum is σ = 1393438815600. Its totient is φ = 650271447168.
The previous prime is 1010243141221. The next prime is 1010243141267. The reversal of 1010243141223 is 3221413420101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1010243141223 - 21 = 1010243141221 is a prime.
It is a super-2 number, since 2×10102431412232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010243141193 and 1010243141202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010243141221) 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, 5805994978 + ... + 5805995151.
It is an arithmetic number, because the mean of its divisors is an integer number (174179851950).
Almost surely, 21010243141223 is an apocalyptic number.
1010243141223 is a deficient number, since it is larger than the sum of its proper divisors (383195674377).
1010243141223 is a wasteful number, since it uses less digits than its factorization.
1010243141223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11611990161.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1010243141223 its reverse (3221413420101), we get a palindrome (4231656561324).
The spelling of 1010243141223 in words is "one trillion, ten billion, two hundred forty-three million, one hundred forty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •