Base | Representation |
---|---|
bin | 101111100110011111… |
… | …0111101000111010000 |
3 | 100202212010011211202201 |
4 | 1133030332331013100 |
5 | 3133323131144440 |
6 | 114543304052544 |
7 | 10246121511541 |
oct | 1371476750720 |
9 | 322763154681 |
10 | 102223303120 |
11 | 3a3974316a4 |
12 | 1798a464154 |
13 | 984130cb13 |
14 | 4d3a4464c8 |
15 | 29d450b19a |
hex | 17ccfbd1d0 |
102223303120 has 40 divisors (see below), whose sum is σ = 248002626816. Its totient is φ = 39111523968.
The previous prime is 102223303081. The next prime is 102223303129. The reversal of 102223303120 is 21303322201.
102223303120 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102223303129) 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, 27776232 + ... + 27779911.
Almost surely, 2102223303120 is an apocalyptic number.
102223303120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102223303120 is an abundant number, since it is smaller than the sum of its proper divisors (145779323696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102223303120 is a wasteful number, since it uses less digits than its factorization.
102223303120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55556179 (or 55556173 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 102223303120 its reverse (21303322201), we get a palindrome (123526625321).
The spelling of 102223303120 in words is "one hundred two billion, two hundred twenty-three million, three hundred three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •