Base | Representation |
---|---|
bin | 10000101001101110001… |
… | …101011011000001001000 |
3 | 11001101122221201220010122 |
4 | 100221232031123001020 |
5 | 122222021420004112 |
6 | 2233404445202412 |
7 | 145450035113435 |
oct | 20515615330110 |
9 | 4041587656118 |
10 | 1144310313032 |
11 | 401332381007 |
12 | 165937260408 |
13 | 83ba5b4b203 |
14 | 3d5562c4b8c |
15 | 1eb75aa7872 |
hex | 10a6e35b048 |
1144310313032 has 8 divisors (see below), whose sum is σ = 2145581836950. Its totient is φ = 572155156512.
The previous prime is 1144310313011. The next prime is 1144310313043. The reversal of 1144310313032 is 2303130134411.
It can be written as a sum of positive squares in only one way, i.e., 1142902112356 + 1408200676 = 1069066^2 + 37526^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×11443103130322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1144310312992 and 1144310313010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71519394557 + ... + 71519394572.
Almost surely, 21144310313032 is an apocalyptic number.
It is an amenable number.
1144310313032 is a deficient number, since it is larger than the sum of its proper divisors (1001271523918).
1144310313032 is a wasteful number, since it uses less digits than its factorization.
1144310313032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143038789135 (or 143038789131 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 1144310313032 its reverse (2303130134411), we get a palindrome (3447440447443).
The spelling of 1144310313032 in words is "one trillion, one hundred forty-four billion, three hundred ten million, three hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •