Base | Representation |
---|---|
bin | 10111001100011111000001… |
… | …110100111000100010001001 |
3 | 111101012100102202210122121102 |
4 | 113030133001310320202021 |
5 | 101332340131122104113 |
6 | 1000544045013551145 |
7 | 30326124510604451 |
oct | 2714370164704211 |
9 | 441170382718542 |
10 | 102013020113033 |
11 | 2a56052a41a657 |
12 | b5369820454b5 |
13 | 44bca2bca19c3 |
14 | 1b29656984d61 |
15 | bbd8d5873758 |
hex | 5cc7c1d38889 |
102013020113033 has 8 divisors (see below), whose sum is σ = 104183948615040. Its totient is φ = 99842109890800.
The previous prime is 102013020112973. The next prime is 102013020113071. The reversal of 102013020113033 is 330311020310201.
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 102013020113033 - 246 = 31644275935369 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102013020112996 and 102013020113014.
It is not an unprimeable number, because it can be changed into a prime (102013020113533) 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, 7019558 + ... + 15915408.
It is an arithmetic number, because the mean of its divisors is an integer number (13022993576880).
Almost surely, 2102013020113033 is an apocalyptic number.
It is an amenable number.
102013020113033 is a deficient number, since it is larger than the sum of its proper divisors (2170928502007).
102013020113033 is an equidigital number, since it uses as much as digits as its factorization.
102013020113033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9139887.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 102013020113033 its reverse (330311020310201), we get a palindrome (432324040423234).
The spelling of 102013020113033 in words is "one hundred two trillion, thirteen billion, twenty million, one hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.038 sec. • engine limits •