Base | Representation |
---|---|
bin | 1001010010000101111001… |
… | …0010101110001101000010 |
3 | 1100010201120020220020021202 |
4 | 2110201132102232031002 |
5 | 2314210224102331232 |
6 | 33412433325221202 |
7 | 2102250464536433 |
oct | 224413622561502 |
9 | 40121506806252 |
10 | 10206424261442 |
11 | 328557a4619a2 |
12 | 118a0a6a01802 |
13 | 5906003caa16 |
14 | 273dca4db48a |
15 | 12a75c3a7162 |
hex | 9485e4ae342 |
10206424261442 has 8 divisors (see below), whose sum is σ = 15309659483532. Its totient is φ = 5103204433600.
The previous prime is 10206424261441. The next prime is 10206424261483. The reversal of 10206424261442 is 24416242460201.
It can be written as a sum of positive squares in 2 ways, for example, as 9223314334081 + 983109927361 = 3036991^2 + 991519^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×102064242614423 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10206424261396 and 10206424261405.
It is not an unprimeable number, because it can be changed into a prime (10206424261441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2016659 + ... + 4947702.
Almost surely, 210206424261442 is an apocalyptic number.
10206424261442 is a deficient number, since it is larger than the sum of its proper divisors (5103235222090).
10206424261442 is an equidigital number, since it uses as much as digits as its factorization.
10206424261442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7697124.
The product of its (nonzero) digits is 147456, while the sum is 38.
The spelling of 10206424261442 in words is "ten trillion, two hundred six billion, four hundred twenty-four million, two hundred sixty-one thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •