Base | Representation |
---|---|
bin | 10100111101100000011… |
… | …000101111010101011001 |
3 | 12002201000010022121221012 |
4 | 110331200120233111121 |
5 | 142100000333022413 |
6 | 3021420330223305 |
7 | 206032140456206 |
oct | 24754030572531 |
9 | 5081003277835 |
10 | 1440431142233 |
11 | 505979911926 |
12 | 1b31b9584b35 |
13 | a5aa80b2885 |
14 | 4da08166cad |
15 | 2770790c7a8 |
hex | 14f6062f559 |
1440431142233 has 8 divisors (see below), whose sum is σ = 1441248235776. Its totient is φ = 1439614168000.
The previous prime is 1440431142209. The next prime is 1440431142259. The reversal of 1440431142233 is 3322411340441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1440431142233 - 28 = 1440431141977 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1440431142233.
It is not an unprimeable number, because it can be changed into a prime (1440431142433) 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, 35774993 + ... + 35815233.
It is an arithmetic number, because the mean of its divisors is an integer number (180156029472).
Almost surely, 21440431142233 is an apocalyptic number.
It is an amenable number.
1440431142233 is a deficient number, since it is larger than the sum of its proper divisors (817093543).
1440431142233 is a wasteful number, since it uses less digits than its factorization.
1440431142233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59655.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 1440431142233 its reverse (3322411340441), we get a palindrome (4762842482674).
The spelling of 1440431142233 in words is "one trillion, four hundred forty billion, four hundred thirty-one million, one hundred forty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •