Base | Representation |
---|---|
bin | 10101010010101010000… |
… | …000001011101100000001 |
3 | 12011212121211000201222002 |
4 | 111102222000023230001 |
5 | 142433003102231413 |
6 | 3040054022353345 |
7 | 210464666524124 |
oct | 25225200135401 |
9 | 5155554021862 |
10 | 1463141055233 |
11 | 514572a88670 |
12 | 1b7696b8b855 |
13 | a7c87035010 |
14 | 50b603023bb |
15 | 280d651a958 |
hex | 154aa00bb01 |
1463141055233 has 8 divisors (see below), whose sum is σ = 1718934946176. Its totient is φ = 1227810675600.
The previous prime is 1463141055227. The next prime is 1463141055253. The reversal of 1463141055233 is 3325501413641.
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 1463141055233 - 218 = 1463140793089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1463141055223) 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, 5115877673 + ... + 5115877958.
It is an arithmetic number, because the mean of its divisors is an integer number (214866868272).
Almost surely, 21463141055233 is an apocalyptic number.
1463141055233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1463141055233 is a deficient number, since it is larger than the sum of its proper divisors (255793890943).
1463141055233 is a wasteful number, since it uses less digits than its factorization.
1463141055233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10231755655.
The product of its (nonzero) digits is 129600, while the sum is 38.
Adding to 1463141055233 its reverse (3325501413641), we get a palindrome (4788642468874).
The spelling of 1463141055233 in words is "one trillion, four hundred sixty-three billion, one hundred forty-one million, fifty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •