Base | Representation |
---|---|
bin | 10111000001010010001100… |
… | …111001111100101101010111 |
3 | 111021110202201221220022201112 |
4 | 113001102030321330231113 |
5 | 101232232321233234143 |
6 | 555154313430045235 |
7 | 30216406114141001 |
oct | 2701221471745527 |
9 | 437422657808645 |
10 | 101243333102423 |
11 | 2a294069145506 |
12 | b4317774a981b |
13 | 44652891b5655 |
14 | 1b002bc45d371 |
15 | ba88888d2e18 |
hex | 5c148ce7cb57 |
101243333102423 has 32 divisors (see below), whose sum is σ = 104845253990400. Its totient is φ = 97703227683936.
The previous prime is 101243333102419. The next prime is 101243333102437. The reversal of 101243333102423 is 324201333342101.
It is a cyclic number.
It is not a de Polignac number, because 101243333102423 - 22 = 101243333102419 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101243333102423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101243333102123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6097885640 + ... + 6097902242.
It is an arithmetic number, because the mean of its divisors is an integer number (3276414187200).
Almost surely, 2101243333102423 is an apocalyptic number.
101243333102423 is a deficient number, since it is larger than the sum of its proper divisors (3601920887977).
101243333102423 is a wasteful number, since it uses less digits than its factorization.
101243333102423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20211.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 101243333102423 its reverse (324201333342101), we get a palindrome (425444666444524).
The spelling of 101243333102423 in words is "one hundred one trillion, two hundred forty-three billion, three hundred thirty-three million, one hundred two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •