Base | Representation |
---|---|
bin | 101111111110010001… |
… | …0111001111111000010 |
3 | 100211220201200002012212 |
4 | 1133330202321333002 |
5 | 3141441420203032 |
6 | 115154411022122 |
7 | 10304651142623 |
oct | 1377442717702 |
9 | 324821602185 |
10 | 103021256642 |
11 | 3a7668a4a17 |
12 | 17b7173a942 |
13 | 993a727375 |
14 | 4db43dba4a |
15 | 2a2e5cbbb2 |
hex | 17fc8b9fc2 |
103021256642 has 8 divisors (see below), whose sum is σ = 156061903932. Its totient is φ = 51000622000.
The previous prime is 103021256641. The next prime is 103021256651. The reversal of 103021256642 is 246652120301.
It can be written as a sum of positive squares in 2 ways, for example, as 95970463681 + 7050792961 = 309791^2 + 83969^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1030212566422 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103021256599 and 103021256608.
It is not an unprimeable number, because it can be changed into a prime (103021256641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 255002909 + ... + 255003312.
Almost surely, 2103021256642 is an apocalyptic number.
103021256642 is a deficient number, since it is larger than the sum of its proper divisors (53040647290).
103021256642 is a wasteful number, since it uses less digits than its factorization.
103021256642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510006324.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 103021256642 its reverse (246652120301), we get a palindrome (349673376943).
The spelling of 103021256642 in words is "one hundred three billion, twenty-one million, two hundred fifty-six thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •