Base | Representation |
---|---|
bin | 101111000101000100… |
… | …1100110010111000001 |
3 | 100122221222021202112111 |
4 | 1132022021212113001 |
5 | 3124024104120113 |
6 | 114240131055321 |
7 | 10206254663620 |
oct | 1361211462701 |
9 | 318858252474 |
10 | 101102020033 |
11 | 39971500063 |
12 | 17716a41541 |
13 | 96c2c199c1 |
14 | 4c715676b7 |
15 | 296ad6e13d |
hex | 178a2665c1 |
101102020033 has 8 divisors (see below), whose sum is σ = 122341940352. Its totient is φ = 81561293376.
The previous prime is 101102019947. The next prime is 101102020043. The reversal of 101102020033 is 330020201101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101102020033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101102019995 and 101102020022.
It is not an unprimeable number, because it can be changed into a prime (101102020043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 424798285 + ... + 424798522.
It is an arithmetic number, because the mean of its divisors is an integer number (15292742544).
Almost surely, 2101102020033 is an apocalyptic number.
It is an amenable number.
101102020033 is a deficient number, since it is larger than the sum of its proper divisors (21239920319).
101102020033 is an equidigital number, since it uses as much as digits as its factorization.
101102020033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 849596831.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 101102020033 its reverse (330020201101), we get a palindrome (431122221134).
The spelling of 101102020033 in words is "one hundred one billion, one hundred two million, twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •