Base | Representation |
---|---|
bin | 101111100001011001… |
… | …1001011100101110101 |
3 | 100202102012200022211220 |
4 | 1133002303023211311 |
5 | 3133000411211113 |
6 | 114514322020553 |
7 | 10241645315544 |
oct | 1370263134565 |
9 | 322365608756 |
10 | 102052444533 |
11 | 3a309a43056 |
12 | 179411a7759 |
13 | 9814ab9a70 |
14 | 4d2188c15b |
15 | 29c450b523 |
hex | 17c2ccb975 |
102052444533 has 32 divisors (see below), whose sum is σ = 150149704320. Its totient is φ = 61253928960.
The previous prime is 102052444523. The next prime is 102052444553. The reversal of 102052444533 is 335444250201.
It is not a de Polignac number, because 102052444533 - 236 = 33332967797 is a prime.
It is a super-2 number, since 2×1020524445332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102052444494 and 102052444503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102052444523) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9913453 + ... + 9923741.
It is an arithmetic number, because the mean of its divisors is an integer number (4692178260).
Almost surely, 2102052444533 is an apocalyptic number.
102052444533 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
102052444533 is a deficient number, since it is larger than the sum of its proper divisors (48097259787).
102052444533 is a wasteful number, since it uses less digits than its factorization.
102052444533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16549.
The product of its (nonzero) digits is 57600, while the sum is 33.
Adding to 102052444533 its reverse (335444250201), we get a palindrome (437496694734).
The spelling of 102052444533 in words is "one hundred two billion, fifty-two million, four hundred forty-four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •