Base | Representation |
---|---|
bin | 101111001110111110… |
… | …1010000111110011001 |
3 | 100200211010120220112022 |
4 | 1132131331100332121 |
5 | 3130214142043113 |
6 | 114333121424225 |
7 | 10220431405430 |
oct | 1363575207631 |
9 | 320733526468 |
10 | 101434331033 |
11 | 3a022043252 |
12 | 177aa19b075 |
13 | 9746a1b629 |
14 | 4ca374c117 |
15 | 298a111908 |
hex | 179df50f99 |
101434331033 has 32 divisors (see below), whose sum is σ = 119691264000. Its totient is φ = 84159020736.
The previous prime is 101434331003. The next prime is 101434331077. The reversal of 101434331033 is 330133434101.
It is not a de Polignac number, because 101434331033 - 212 = 101434326937 is a prime.
It is a super-2 number, since 2×1014343310332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101434330993 and 101434331011.
It is not an unprimeable number, because it can be changed into a prime (101434331003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15367868 + ... + 15374466.
It is an arithmetic number, because the mean of its divisors is an integer number (3740352000).
Almost surely, 2101434331033 is an apocalyptic number.
It is an amenable number.
101434331033 is a deficient number, since it is larger than the sum of its proper divisors (18256932967).
101434331033 is a wasteful number, since it uses less digits than its factorization.
101434331033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7101.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 101434331033 its reverse (330133434101), we get a palindrome (431567765134).
The spelling of 101434331033 in words is "one hundred one billion, four hundred thirty-four million, three hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •