Base | Representation |
---|---|
bin | 101111001110111110… |
… | …1101110010101101111 |
3 | 100200211010211000112001 |
4 | 1132131331232111233 |
5 | 3130214204420221 |
6 | 114333124153131 |
7 | 10220432416204 |
oct | 1363575562557 |
9 | 320733730461 |
10 | 101434451311 |
11 | 3a022115656 |
12 | 177aa2387a7 |
13 | 9746a612bb |
14 | 4ca377dcab |
15 | 298a137391 |
hex | 179df6e56f |
101434451311 has 4 divisors (see below), whose sum is σ = 101435923512. Its totient is φ = 101432979112.
The previous prime is 101434451303. The next prime is 101434451333. The reversal of 101434451311 is 113154434101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113154434101 = 223 ⋅507418987.
It is a cyclic number.
It is not a de Polignac number, because 101434451311 - 23 = 101434451303 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101434451311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101434451341) 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, 627400 + ... + 772333.
It is an arithmetic number, because the mean of its divisors is an integer number (25358980878).
Almost surely, 2101434451311 is an apocalyptic number.
101434451311 is a deficient number, since it is larger than the sum of its proper divisors (1472201).
101434451311 is an equidigital number, since it uses as much as digits as its factorization.
101434451311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1472200.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 101434451311 its reverse (113154434101), we get a palindrome (214588885412).
The spelling of 101434451311 in words is "one hundred one billion, four hundred thirty-four million, four hundred fifty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •