Base | Representation |
---|---|
bin | 10111001100010101000100… |
… | …101110010110010001000111 |
3 | 111101011022211211221100202222 |
4 | 113030111010232112101013 |
5 | 101332201233304010343 |
6 | 1000535120223522555 |
7 | 30325265600400005 |
oct | 2714250456262107 |
9 | 441138754840688 |
10 | 102002331313223 |
11 | 2a556a44916100 |
12 | b53489a45945b |
13 | 44bba176970a3 |
14 | 1b28d21161a75 |
15 | bbd4ac2a6a68 |
hex | 5cc544b96447 |
102002331313223 has 12 divisors (see below), whose sum is σ = 112124638779720. Its totient is φ = 92724120553680.
The previous prime is 102002331313219. The next prime is 102002331313261. The reversal of 102002331313223 is 322313133200201.
It is not a de Polignac number, because 102002331313223 - 22 = 102002331313219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102002331313192 and 102002331313201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102002331313123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21823553 + ... + 26082026.
It is an arithmetic number, because the mean of its divisors is an integer number (9343719898310).
Almost surely, 2102002331313223 is an apocalyptic number.
102002331313223 is a deficient number, since it is larger than the sum of its proper divisors (10122307466497).
102002331313223 is a wasteful number, since it uses less digits than its factorization.
102002331313223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47923198 (or 47923187 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 102002331313223 its reverse (322313133200201), we get a palindrome (424315464513424).
The spelling of 102002331313223 in words is "one hundred two trillion, two billion, three hundred thirty-one million, three hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •