Base | Representation |
---|---|
bin | 101111000110010101… |
… | …1010100010011110111 |
3 | 100200001221001120100100 |
4 | 1132030223110103313 |
5 | 3124120432212211 |
6 | 114244243445143 |
7 | 10210311220545 |
oct | 1361453242367 |
9 | 320057046310 |
10 | 101144413431 |
11 | 39993425926 |
12 | 177290867b3 |
13 | 96cb940a59 |
14 | 4c77040d95 |
15 | 296e945156 |
hex | 178cad44f7 |
101144413431 has 24 divisors (see below), whose sum is σ = 146962632960. Its totient is φ = 67030563600.
The previous prime is 101144413421. The next prime is 101144413451. The reversal of 101144413431 is 134314441101.
101144413431 is a `hidden beast` number, since 101 + 144 + 413 + 4 + 3 + 1 = 666.
It is not a de Polignac number, because 101144413431 - 213 = 101144405239 is a prime.
It is a super-2 number, since 2×1011444134312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101144413395 and 101144413404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101144413411) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5840896 + ... + 5858186.
It is an arithmetic number, because the mean of its divisors is an integer number (6123443040).
Almost surely, 2101144413431 is an apocalyptic number.
101144413431 is a deficient number, since it is larger than the sum of its proper divisors (45818219529).
101144413431 is a wasteful number, since it uses less digits than its factorization.
101144413431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21107 (or 21104 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 101144413431 its reverse (134314441101), we get a palindrome (235458854532).
The spelling of 101144413431 in words is "one hundred one billion, one hundred forty-four million, four hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •