Base | Representation |
---|---|
bin | 101111111110010001… |
… | …0000000101100111101 |
3 | 100211220201020011100220 |
4 | 1133330202000230331 |
5 | 3141441340201023 |
6 | 115154402011553 |
7 | 10304646144600 |
oct | 1377442005475 |
9 | 324821204326 |
10 | 103021022013 |
11 | 3a766754708 |
12 | 17b71646bb9 |
13 | 993a674630 |
14 | 4db437a337 |
15 | 2a2e5823e3 |
hex | 17fc880b3d |
103021022013 has 48 divisors (see below), whose sum is σ = 172719630720. Its totient is φ = 54138478464.
The previous prime is 103021022009. The next prime is 103021022029. The reversal of 103021022013 is 310220120301.
It is not a de Polignac number, because 103021022013 - 22 = 103021022009 is a prime.
It is a super-2 number, since 2×1030210220132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103021021983 and 103021022001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103021022053) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 413856 + ... + 614262.
It is an arithmetic number, because the mean of its divisors is an integer number (3598325640).
Almost surely, 2103021022013 is an apocalyptic number.
103021022013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
103021022013 is a deficient number, since it is larger than the sum of its proper divisors (69698608707).
103021022013 is a wasteful number, since it uses less digits than its factorization.
103021022013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200706 (or 200699 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 103021022013 its reverse (310220120301), we get a palindrome (413241142314).
The spelling of 103021022013 in words is "one hundred three billion, twenty-one million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •