Base | Representation |
---|---|
bin | 1001010100011001011100… |
… | …0011111111100010001001 |
3 | 1100021111210112201201010122 |
4 | 2111012113003333202021 |
5 | 2320332333020012431 |
6 | 33442543431553025 |
7 | 2105152131656630 |
oct | 225062703774211 |
9 | 40244715651118 |
10 | 10246031407241 |
11 | 32a0354685843 |
12 | 11958bb22b775 |
13 | 594272c71376 |
14 | 275ca6844517 |
15 | 12b7c963ca7b |
hex | 951970ff889 |
10246031407241 has 8 divisors (see below), whose sum is σ = 11709779383680. Its totient is φ = 8782290731808.
The previous prime is 10246031407211. The next prime is 10246031407247. The reversal of 10246031407241 is 14270413064201.
10246031407241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10246031407241 - 242 = 5847984896137 is a prime.
It is a super-3 number, since 3×102460314072413 (a number of 40 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (10246031407247) 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, 1614020 + ... + 4805946.
It is an arithmetic number, because the mean of its divisors is an integer number (1463722422960).
Almost surely, 210246031407241 is an apocalyptic number.
It is an amenable number.
10246031407241 is a deficient number, since it is larger than the sum of its proper divisors (1463747976439).
10246031407241 is an equidigital number, since it uses as much as digits as its factorization.
10246031407241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3650503.
The product of its (nonzero) digits is 32256, while the sum is 35.
The spelling of 10246031407241 in words is "ten trillion, two hundred forty-six billion, thirty-one million, four hundred seven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •