Base | Representation |
---|---|
bin | 10110110001010001011101… |
… | …001101100100110001101011 |
3 | 111010120120122100011000111020 |
4 | 112301101131031210301223 |
5 | 101111220401424010011 |
6 | 552553022513503523 |
7 | 30044044265222526 |
oct | 2661213515446153 |
9 | 433516570130436 |
10 | 100143021313131 |
11 | 299aa464898615 |
12 | b29447b271ba3 |
13 | 43b55a5942494 |
14 | 1aa2d3b7d3bbd |
15 | b89e3a895006 |
hex | 5b145d364c6b |
100143021313131 has 8 divisors (see below), whose sum is σ = 133594713458640. Its totient is φ = 66726671688192.
The previous prime is 100143021313117. The next prime is 100143021313147. The reversal of 100143021313131 is 131313120341001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100143021313131 - 235 = 100108661574763 is a prime.
It is a super-2 number, since 2×1001430213131312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100143021313031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8835623530 + ... + 8835634863.
It is an arithmetic number, because the mean of its divisors is an integer number (16699339182330).
Almost surely, 2100143021313131 is an apocalyptic number.
100143021313131 is a deficient number, since it is larger than the sum of its proper divisors (33451692145509).
100143021313131 is a wasteful number, since it uses less digits than its factorization.
100143021313131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17671260285.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 100143021313131 its reverse (131313120341001), we get a palindrome (231456141654132).
The spelling of 100143021313131 in words is "one hundred trillion, one hundred forty-three billion, twenty-one million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •