Base | Representation |
---|---|
bin | 10000101000100001010… |
… | …111001000010100000111 |
3 | 11001021100002200121221010 |
4 | 100220201113020110013 |
5 | 122211401334342411 |
6 | 2233032511053303 |
7 | 145403061204120 |
oct | 20504127102407 |
9 | 4037302617833 |
10 | 1143021012231 |
11 | 40083062125a |
12 | 165637511233 |
13 | 83a2b9bb127 |
14 | 3d472d8b047 |
15 | 1eaec7cc7a6 |
hex | 10a215c8507 |
1143021012231 has 16 divisors (see below), whose sum is σ = 1747346784768. Its totient is φ = 651054684000.
The previous prime is 1143021012173. The next prime is 1143021012281. The reversal of 1143021012231 is 1322101203411.
It is not a de Polignac number, because 1143021012231 - 26 = 1143021012167 is a prime.
It is a super-2 number, since 2×11430210122312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1143021012198 and 1143021012207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1143021012281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87500820 + ... + 87513881.
It is an arithmetic number, because the mean of its divisors is an integer number (109209174048).
Almost surely, 21143021012231 is an apocalyptic number.
1143021012231 is a deficient number, since it is larger than the sum of its proper divisors (604325772537).
1143021012231 is a wasteful number, since it uses less digits than its factorization.
1143021012231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175015022.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1143021012231 its reverse (1322101203411), we get a palindrome (2465122215642).
The spelling of 1143021012231 in words is "one trillion, one hundred forty-three billion, twenty-one million, twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •