Base | Representation |
---|---|
bin | 10110111111001111101000… |
… | …111111000001010100100110 |
3 | 111020222100212221101210222201 |
4 | 112333033220333001110212 |
5 | 101222433214331441032 |
6 | 555010050531245114 |
7 | 30203314105434553 |
oct | 2677175077012446 |
9 | 436870787353881 |
10 | 101103144015142 |
11 | 2a23a66a052295 |
12 | b40a57244979a |
13 | 4454ca73ba4b9 |
14 | 1ad75bda8da2a |
15 | ba4dd12b08e7 |
hex | 5bf3e8fc1526 |
101103144015142 has 16 divisors (see below), whose sum is σ = 151871086555200. Its totient is φ = 50479453540800.
The previous prime is 101103144015119. The next prime is 101103144015151. The reversal of 101103144015142 is 241510441301101.
It is a super-2 number, since 2×1011031440151422 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101103144015142.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39306484 + ... + 41799592.
It is an arithmetic number, because the mean of its divisors is an integer number (9491942909700).
Almost surely, 2101103144015142 is an apocalyptic number.
101103144015142 is a deficient number, since it is larger than the sum of its proper divisors (50767942540058).
101103144015142 is a wasteful number, since it uses less digits than its factorization.
101103144015142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2522031.
The product of its (nonzero) digits is 1920, while the sum is 28.
Adding to 101103144015142 its reverse (241510441301101), we get a palindrome (342613585316243).
The spelling of 101103144015142 in words is "one hundred one trillion, one hundred three billion, one hundred forty-four million, fifteen thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •