Base | Representation |
---|---|
bin | 101111111110010001… |
… | …0110011110001110100 |
3 | 100211220201121210100022 |
4 | 1133330202303301310 |
5 | 3141441413344340 |
6 | 115154410304312 |
7 | 10304651005535 |
oct | 1377442636164 |
9 | 324821553308 |
10 | 103021231220 |
11 | 3a766887906 |
12 | 17b71728098 |
13 | 993a71891b |
14 | 4db43d268c |
15 | 2a2e5c43b5 |
hex | 17fc8b3c74 |
103021231220 has 24 divisors (see below), whose sum is σ = 216432669600. Its totient is φ = 41191714592.
The previous prime is 103021231207. The next prime is 103021231267. The reversal of 103021231220 is 22132120301.
103021231220 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1030212312202 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 998210 + ... + 1096569.
It is an arithmetic number, because the mean of its divisors is an integer number (9018027900).
Almost surely, 2103021231220 is an apocalyptic number.
103021231220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103021231220 is an abundant number, since it is smaller than the sum of its proper divisors (113411438380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103021231220 is a wasteful number, since it uses less digits than its factorization.
103021231220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2097247 (or 2097245 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 103021231220 its reverse (22132120301), we get a palindrome (125153351521).
The spelling of 103021231220 in words is "one hundred three billion, twenty-one million, two hundred thirty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •