Base | Representation |
---|---|
bin | 10011001100101011… |
… | …10101100011110111 |
3 | 222121022022112211111 |
4 | 21212111311203313 |
5 | 132102033410111 |
6 | 4422425215451 |
7 | 513262334161 |
oct | 114625654367 |
9 | 28538275744 |
10 | 10306935031 |
11 | 4409aa5928 |
12 | 1bb7931587 |
13 | c83475a33 |
14 | 6dac1d931 |
15 | 404cdba21 |
hex | 2665758f7 |
10306935031 has 8 divisors (see below), whose sum is σ = 10326238400. Its totient is φ = 10287648000.
The previous prime is 10306935013. The next prime is 10306935047. The reversal of 10306935031 is 13053960301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a 8-Lehmer number, since φ(10306935031) divides (10306935031-1)8.
It is a cyclic number.
It is not a de Polignac number, because 10306935031 - 217 = 10306803959 is a prime.
It is a super-2 number, since 2×103069350312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10306934984 and 10306935002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10306935731) 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, 2648335 + ... + 2652223.
It is an arithmetic number, because the mean of its divisors is an integer number (1290779800).
Almost surely, 210306935031 is an apocalyptic number.
10306935031 is the 45403-rd centered decagonal number.
10306935031 is a deficient number, since it is larger than the sum of its proper divisors (19303369).
10306935031 is an equidigital number, since it uses as much as digits as its factorization.
10306935031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8169.
The product of its (nonzero) digits is 7290, while the sum is 31.
The spelling of 10306935031 in words is "ten billion, three hundred six million, nine hundred thirty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •