Base | Representation |
---|---|
bin | 10110101111010111100011… |
… | …000001100101100100100111 |
3 | 111010010001202202121202210220 |
4 | 112233113203001211210213 |
5 | 101102044311304101211 |
6 | 552412533522215423 |
7 | 30031431424230342 |
oct | 2657274301454447 |
9 | 433101682552726 |
10 | 100012122331431 |
11 | 299599a2822202 |
12 | b2730294b4573 |
13 | 43a614473c91b |
14 | 1a9a880b95459 |
15 | b86828b56806 |
hex | 5af5e3065927 |
100012122331431 has 8 divisors (see below), whose sum is σ = 133356879798384. Its totient is φ = 66671056542720.
The previous prime is 100012122331423. The next prime is 100012122331441. The reversal of 100012122331431 is 134133221210001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100012122331431 - 23 = 100012122331423 is a prime.
It is a super-2 number, since 2×1000121223314312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100012122331441) 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, 922856346 + ... + 922964711.
It is an arithmetic number, because the mean of its divisors is an integer number (16669609974798).
Almost surely, 2100012122331431 is an apocalyptic number.
100012122331431 is a deficient number, since it is larger than the sum of its proper divisors (33344757466953).
100012122331431 is a wasteful number, since it uses less digits than its factorization.
100012122331431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1845839121.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 100012122331431 its reverse (134133221210001), we get a palindrome (234145343541432).
The spelling of 100012122331431 in words is "one hundred trillion, twelve billion, one hundred twenty-two million, three hundred thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •