Base | Representation |
---|---|
bin | 1001100001000010011110… |
… | …1001000111000001100010 |
3 | 1101001021100202221200202102 |
4 | 2120100213221013001202 |
5 | 2332412121041434104 |
6 | 34130421420450402 |
7 | 2126640661432223 |
oct | 230204751070142 |
9 | 41037322850672 |
10 | 10463205421154 |
11 | 3374469759872 |
12 | 120ba0a3a9a02 |
13 | 5ab8a333cc45 |
14 | 2825c978124a |
15 | 13228a6ada1e |
hex | 98427a47062 |
10463205421154 has 8 divisors (see below), whose sum is σ = 16520850665040. Its totient is φ = 4956255199476.
The previous prime is 10463205421139. The next prime is 10463205421189. The reversal of 10463205421154 is 45112450236401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (38), and also a Moran number because the ratio is a prime number: 275347511083 = 10463205421154 / (1 + 0 + 4 + 6 + 3 + 2 + 0 + 5 + 4 + 2 + 1 + 1 + 5 + 4).
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 in 3 ways as a sum of consecutive naturals, for example, 137673755504 + ... + 137673755579.
It is an arithmetic number, because the mean of its divisors is an integer number (2065106333130).
Almost surely, 210463205421154 is an apocalyptic number.
10463205421154 is a deficient number, since it is larger than the sum of its proper divisors (6057645243886).
10463205421154 is a wasteful number, since it uses less digits than its factorization.
10463205421154 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275347511104.
The product of its (nonzero) digits is 115200, while the sum is 38.
Adding to 10463205421154 its reverse (45112450236401), we get a palindrome (55575655657555).
The spelling of 10463205421154 in words is "ten trillion, four hundred sixty-three billion, two hundred five million, four hundred twenty-one thousand, one hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •