Base | Representation |
---|---|
bin | 1001100010111110000000… |
… | …0110010010100100111110 |
3 | 1101011102221201021012000002 |
4 | 2120233200012102210332 |
5 | 2333433023400140340 |
6 | 34153544034234302 |
7 | 2132223464062313 |
oct | 230574006224476 |
9 | 41142851235002 |
10 | 10496364849470 |
11 | 3387535355085 |
12 | 1216323425992 |
13 | 5b1a59139a46 |
14 | 284053652d0a |
15 | 13307b86e715 |
hex | 98be019293e |
10496364849470 has 8 divisors (see below), whose sum is σ = 18893456729064. Its totient is φ = 4198545939784.
The previous prime is 10496364849431. The next prime is 10496364849473. The reversal of 10496364849470 is 7494846369401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×104963648494702 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10496364849397 and 10496364849406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10496364849473) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 524818242464 + ... + 524818242483.
It is an arithmetic number, because the mean of its divisors is an integer number (2361682091133).
Almost surely, 210496364849470 is an apocalyptic number.
10496364849470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10496364849470 is a deficient number, since it is larger than the sum of its proper divisors (8397091879594).
10496364849470 is a wasteful number, since it uses less digits than its factorization.
10496364849470 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1049636484954.
The product of its (nonzero) digits is 125411328, while the sum is 65.
The spelling of 10496364849470 in words is "ten trillion, four hundred ninety-six billion, three hundred sixty-four million, eight hundred forty-nine thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •