Base | Representation |
---|---|
bin | 101111101001101111… |
… | …0100010000111010001 |
3 | 100210010201011122011011 |
4 | 1133103132202013101 |
5 | 3134034023310213 |
6 | 115002155050521 |
7 | 10251613503646 |
oct | 1372336420721 |
9 | 323121148134 |
10 | 102332244433 |
11 | 3a44297a941 |
12 | 179baa40a41 |
13 | 985aa64333 |
14 | 4d4aac3dcd |
15 | 29ddd7a03d |
hex | 17d37a21d1 |
102332244433 has 8 divisors (see below), whose sum is σ = 106332847616. Its totient is φ = 98375364000.
The previous prime is 102332244409. The next prime is 102332244449. The reversal of 102332244433 is 334442233201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102332244433 - 29 = 102332243921 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102332244395 and 102332244404.
It is not an unprimeable number, because it can be changed into a prime (102332244403) 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, 10925916 + ... + 10935277.
It is an arithmetic number, because the mean of its divisors is an integer number (13291605952).
Almost surely, 2102332244433 is an apocalyptic number.
It is an amenable number.
102332244433 is a deficient number, since it is larger than the sum of its proper divisors (4000603183).
102332244433 is a wasteful number, since it uses less digits than its factorization.
102332244433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21861375.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 102332244433 its reverse (334442233201), we get a palindrome (436774477634).
The spelling of 102332244433 in words is "one hundred two billion, three hundred thirty-two million, two hundred forty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •