Base | Representation |
---|---|
bin | 101111000101101001… |
… | …0110110100111010011 |
3 | 100200000022102101020001 |
4 | 1132023102312213103 |
5 | 3124044013114443 |
6 | 114242054430431 |
7 | 10206610133404 |
oct | 1361322664723 |
9 | 320008371201 |
10 | 101121223123 |
11 | 39981326688 |
12 | 17721362417 |
13 | 96c6bb148b |
14 | 4c73d259ab |
15 | 296c8b3d4d |
hex | 178b4b69d3 |
101121223123 has 8 divisors (see below), whose sum is σ = 101816262000. Its totient is φ = 100426402848.
The previous prime is 101121223079. The next prime is 101121223127. The reversal of 101121223123 is 321322121101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101121223123 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 101121223123.
It is not an unprimeable number, because it can be changed into a prime (101121223127) 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, 934965 + ... + 1037497.
It is an arithmetic number, because the mean of its divisors is an integer number (12727032750).
Almost surely, 2101121223123 is an apocalyptic number.
101121223123 is a deficient number, since it is larger than the sum of its proper divisors (695038877).
101121223123 is a wasteful number, since it uses less digits than its factorization.
101121223123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109301.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 101121223123 its reverse (321322121101), we get a palindrome (422443344224).
It can be divided in two parts, 10112 and 1223123, that added together give a triangular number (1233235 = T1570).
The spelling of 101121223123 in words is "one hundred one billion, one hundred twenty-one million, two hundred twenty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •