Base | Representation |
---|---|
bin | 10011001011001011… |
… | …10100000111010101 |
3 | 222120102121222012101 |
4 | 21211211310013111 |
5 | 132040323034242 |
6 | 4421255322101 |
7 | 513050333062 |
oct | 114545640725 |
9 | 28512558171 |
10 | 10294346197 |
11 | 4402987733 |
12 | 1bb3680331 |
13 | c80988a15 |
14 | 6d92a3c69 |
15 | 403b519b7 |
hex | 2659741d5 |
10294346197 has 4 divisors (see below), whose sum is σ = 10299396960. Its totient is φ = 10289295436.
The previous prime is 10294346189. The next prime is 10294346203. The reversal of 10294346197 is 79164349201.
10294346197 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10294346197 - 23 = 10294346189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10294344197) by changing a digit.
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, 2522323 + ... + 2526400.
It is an arithmetic number, because the mean of its divisors is an integer number (2574849240).
Almost surely, 210294346197 is an apocalyptic number.
It is an amenable number.
10294346197 is a deficient number, since it is larger than the sum of its proper divisors (5050763).
10294346197 is an equidigital number, since it uses as much as digits as its factorization.
10294346197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5050762.
The product of its (nonzero) digits is 326592, while the sum is 46.
The spelling of 10294346197 in words is "ten billion, two hundred ninety-four million, three hundred forty-six thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •