Base | Representation |
---|---|
bin | 1001010111101110111011… |
… | …1111111101100000100000 |
3 | 1100110222201120102221020101 |
4 | 2111323232333331200200 |
5 | 2322302220334221344 |
6 | 33525142322152144 |
7 | 2112251255126221 |
oct | 225735677754040 |
9 | 40428646387211 |
10 | 10303341320224 |
11 | 3312693627697 |
12 | 11a4a341b2654 |
13 | 5997a72a5b94 |
14 | 278981d25248 |
15 | 12d030b179d4 |
hex | 95eeeffd820 |
10303341320224 has 24 divisors (see below), whose sum is σ = 20288782504620. Its totient is φ = 5150634652416.
The previous prime is 10303341320221. The next prime is 10303341320263. The reversal of 10303341320224 is 42202314330301.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 10215566592400 + 87774727824 = 3196180^2 + 296268^2 .
It is a super-2 number, since 2×103033413202242 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10303341320192 and 10303341320201.
It is not an unprimeable number, because it can be changed into a prime (10303341320221) 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, 32213619 + ... + 32531890.
Almost surely, 210303341320224 is an apocalyptic number.
It is an amenable number.
10303341320224 is a deficient number, since it is larger than the sum of its proper divisors (9985441184396).
10303341320224 is an equidigital number, since it uses as much as digits as its factorization.
10303341320224 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64750492 (or 64750484 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 10303341320224 its reverse (42202314330301), we get a palindrome (52505655650525).
The spelling of 10303341320224 in words is "ten trillion, three hundred three billion, three hundred forty-one million, three hundred twenty thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •