Base | Representation |
---|---|
bin | 1001100001000001110110… |
… | …0011110010000011011100 |
3 | 1101001020220222122000211021 |
4 | 2120100131203302003130 |
5 | 2332411244240034010 |
6 | 34130352534533524 |
7 | 2126633535504625 |
oct | 230203543620334 |
9 | 41036828560737 |
10 | 10463036252380 |
11 | 3374392214868 |
12 | 120b9818072a4 |
13 | 5ab87728c08a |
14 | 2825b1106a4c |
15 | 13227a8e48da |
hex | 9841d8f20dc |
10463036252380 has 48 divisors (see below), whose sum is σ = 22393815897600. Its totient is φ = 4105532692800.
The previous prime is 10463036252311. The next prime is 10463036252447. The reversal of 10463036252380 is 8325263036401.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 18230826 + ... + 18795985.
It is an arithmetic number, because the mean of its divisors is an integer number (466537831200).
Almost surely, 210463036252380 is an apocalyptic number.
10463036252380 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10463036252380 is an abundant number, since it is smaller than the sum of its proper divisors (11930779645220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10463036252380 is a wasteful number, since it uses less digits than its factorization.
10463036252380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37027090 (or 37027088 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 43.
Adding to 10463036252380 its reverse (8325263036401), we get a palindrome (18788299288781).
The spelling of 10463036252380 in words is "ten trillion, four hundred sixty-three billion, thirty-six million, two hundred fifty-two thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •