Base | Representation |
---|---|
bin | 10010000111001111110… |
… | …010010110111000000001 |
3 | 11101222212111011111221021 |
4 | 102013033302112320001 |
5 | 130343202244230103 |
6 | 2351453302425441 |
7 | 155633416211461 |
oct | 22071762267001 |
9 | 4358774144837 |
10 | 1244731633153 |
11 | 43a984614158 |
12 | 1812a2132281 |
13 | 904baa254a8 |
14 | 44361299ba1 |
15 | 225a1cb7bbd |
hex | 121cfc96e01 |
1244731633153 has 4 divisors (see below), whose sum is σ = 1244778396228. Its totient is φ = 1244684870080.
The previous prime is 1244731633147. The next prime is 1244731633177. The reversal of 1244731633153 is 3513361374421.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1012824857664 + 231906775489 = 1006392^2 + 481567^2 .
It is a cyclic number.
It is not a de Polignac number, because 1244731633153 - 217 = 1244731502081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1244731633753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23341588 + ... + 23394853.
It is an arithmetic number, because the mean of its divisors is an integer number (311194599057).
Almost surely, 21244731633153 is an apocalyptic number.
It is an amenable number.
1244731633153 is a deficient number, since it is larger than the sum of its proper divisors (46763075).
1244731633153 is an equidigital number, since it uses as much as digits as its factorization.
1244731633153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46763074.
The product of its digits is 544320, while the sum is 43.
The spelling of 1244731633153 in words is "one trillion, two hundred forty-four billion, seven hundred thirty-one million, six hundred thirty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •