Base | Representation |
---|---|
bin | 10111001100110000101110… |
… | …111010100111000011100001 |
3 | 111101021011111121122010111201 |
4 | 113030300232322213003201 |
5 | 101333143044212400113 |
6 | 1001000511222041201 |
7 | 30330366552641563 |
oct | 2714605672470341 |
9 | 441234447563451 |
10 | 102032030200033 |
11 | 2a5685a509535a |
12 | b53a5a8579201 |
13 | 44c176b5617ab |
14 | 1b2a53b5c7333 |
15 | bbe149751cdd |
hex | 5ccc2eea70e1 |
102032030200033 has 4 divisors (see below), whose sum is σ = 102316241983680. Its totient is φ = 101747818416388.
The previous prime is 102032030200031. The next prime is 102032030200057. The reversal of 102032030200033 is 330002030230201.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102032030200033 - 21 = 102032030200031 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102032030200031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 142105891285 + ... + 142105892002.
It is an arithmetic number, because the mean of its divisors is an integer number (25579060495920).
Almost surely, 2102032030200033 is an apocalyptic number.
It is an amenable number.
102032030200033 is a deficient number, since it is larger than the sum of its proper divisors (284211783647).
102032030200033 is an equidigital number, since it uses as much as digits as its factorization.
102032030200033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 284211783646.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 102032030200033 its reverse (330002030230201), we get a palindrome (432034060430234).
The spelling of 102032030200033 in words is "one hundred two trillion, thirty-two billion, thirty million, two hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •