Base | Representation |
---|---|
bin | 10111001100101000100001… |
… | …011000001000011000110001 |
3 | 111101020022202010202012210120 |
4 | 113030220201120020120301 |
5 | 101333022020024414441 |
6 | 1000552452253320453 |
7 | 30326635221012153 |
oct | 2714504130103061 |
9 | 441208663665716 |
10 | 102023213123121 |
11 | 2a564890082a34 |
12 | b538947796129 |
13 | 44c0994969a14 |
14 | 1b29d425caad3 |
15 | bbdcd0659966 |
hex | 5cca21608631 |
102023213123121 has 8 divisors (see below), whose sum is σ = 136039422648864. Its totient is φ = 68011239506400.
The previous prime is 102023213123011. The next prime is 102023213123141. The reversal of 102023213123121 is 121321312320201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102023213123121 - 210 = 102023213122097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102023213123091 and 102023213123100.
It is not an unprimeable number, because it can be changed into a prime (102023213123141) 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, 1058921055 + ... + 1059017396.
It is an arithmetic number, because the mean of its divisors is an integer number (17004927831108).
Almost surely, 2102023213123121 is an apocalyptic number.
It is an amenable number.
102023213123121 is a deficient number, since it is larger than the sum of its proper divisors (34016209525743).
102023213123121 is a wasteful number, since it uses less digits than its factorization.
102023213123121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2117954511.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 102023213123121 its reverse (121321312320201), we get a palindrome (223344525443322).
The spelling of 102023213123121 in words is "one hundred two trillion, twenty-three billion, two hundred thirteen million, one hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •