Base | Representation |
---|---|
bin | 10000101001100010010… |
… | …010011011111111001011 |
3 | 11001101011000101020101110 |
4 | 100221202102123333023 |
5 | 122221114214114011 |
6 | 2233332542221403 |
7 | 145442056046400 |
oct | 20514222337713 |
9 | 4041130336343 |
10 | 1144110301131 |
11 | 40123a490116 |
12 | 1658a0284863 |
13 | 83b7358b685 |
14 | 3d5378dc2a7 |
15 | 1eb63249ba6 |
hex | 10a6249bfcb |
1144110301131 has 48 divisors (see below), whose sum is σ = 1780507449600. Its totient is φ = 651580759872.
The previous prime is 1144110301127. The next prime is 1144110301171. The reversal of 1144110301131 is 1311030114411.
It is not a de Polignac number, because 1144110301131 - 22 = 1144110301127 is a prime.
It is a super-2 number, since 2×11441103011312 (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 = 1144110301098 and 1144110301107.
It is not an unprimeable number, because it can be changed into a prime (1144110301171) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 85958505 + ... + 85971813.
It is an arithmetic number, because the mean of its divisors is an integer number (37093905200).
Almost surely, 21144110301131 is an apocalyptic number.
1144110301131 is a deficient number, since it is larger than the sum of its proper divisors (636397148469).
1144110301131 is a wasteful number, since it uses less digits than its factorization.
1144110301131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15248 (or 15241 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 1144110301131 its reverse (1311030114411), we get a palindrome (2455140415542).
The spelling of 1144110301131 in words is "one trillion, one hundred forty-four billion, one hundred ten million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •