Base | Representation |
---|---|
bin | 101111000101101111… |
… | …0101101011110011111 |
3 | 100200000112021022000021 |
4 | 1132023132231132133 |
5 | 3124100312101143 |
6 | 114242245213011 |
7 | 10206645430453 |
oct | 1361336553637 |
9 | 320015238007 |
10 | 101124331423 |
11 | 39983059a25 |
12 | 17722401167 |
13 | 96c772c1cb |
14 | 4c744d4663 |
15 | 296ccc9ced |
hex | 178b7ad79f |
101124331423 has 4 divisors (see below), whose sum is σ = 101125273480. Its totient is φ = 101123389368.
The previous prime is 101124331367. The next prime is 101124331433. The reversal of 101124331423 is 324133421101.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 101124331423 - 221 = 101122234271 is a prime.
It is a super-2 number, since 2×1011243314232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101124331433) 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, 285708 + ... + 532801.
It is an arithmetic number, because the mean of its divisors is an integer number (25281318370).
Almost surely, 2101124331423 is an apocalyptic number.
101124331423 is a deficient number, since it is larger than the sum of its proper divisors (942057).
101124331423 is an equidigital number, since it uses as much as digits as its factorization.
101124331423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 942056.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 101124331423 its reverse (324133421101), we get a palindrome (425257752524).
The spelling of 101124331423 in words is "one hundred one billion, one hundred twenty-four million, three hundred thirty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •