Base | Representation |
---|---|
bin | 101110110100011000… |
… | …1110011010010111011 |
3 | 100121111221202120111211 |
4 | 1131220301303102323 |
5 | 3121402241232220 |
6 | 114104410503551 |
7 | 10156346014312 |
oct | 1355061632273 |
9 | 317457676454 |
10 | 100542133435 |
11 | 3970445aa67 |
12 | 1759b434bb7 |
13 | 9633c27463 |
14 | 4c1b063279 |
15 | 2936b26b5a |
hex | 1768c734bb |
100542133435 has 4 divisors (see below), whose sum is σ = 120650560128. Its totient is φ = 80433706744.
The previous prime is 100542133429. The next prime is 100542133457. The reversal of 100542133435 is 534331245001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 534331245001 = 72977 ⋅7321913.
It is a cyclic number.
It is not a de Polignac number, because 100542133435 - 25 = 100542133403 is a prime.
It is a super-2 number, since 2×1005421334352 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100542133397 and 100542133406.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10054213339 + ... + 10054213348.
It is an arithmetic number, because the mean of its divisors is an integer number (30162640032).
Almost surely, 2100542133435 is an apocalyptic number.
100542133435 is a deficient number, since it is larger than the sum of its proper divisors (20108426693).
100542133435 is an equidigital number, since it uses as much as digits as its factorization.
100542133435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20108426692.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 100542133435 its reverse (534331245001), we get a palindrome (634873378436).
The spelling of 100542133435 in words is "one hundred billion, five hundred forty-two million, one hundred thirty-three thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •