Base | Representation |
---|---|
bin | 10111101100111100001011… |
… | …010000001000110110000001 |
3 | 111200002120021121012002211201 |
4 | 113230330023100020312001 |
5 | 102130410330021133441 |
6 | 1005412421305541201 |
7 | 30646222100202160 |
oct | 2754741320106601 |
9 | 450076247162751 |
10 | 104243340021121 |
11 | 30240396907314 |
12 | b8370837a4801 |
13 | 4622149298752 |
14 | 1ba55942373d7 |
15 | c0b91da41c31 |
hex | 5ecf0b408d81 |
104243340021121 has 96 divisors (see below), whose sum is σ = 135639816710400. Its totient is φ = 78224612474880.
The previous prime is 104243340021109. The next prime is 104243340021173. The reversal of 104243340021121 is 121120043342401.
It is a happy number.
It is not a de Polignac number, because 104243340021121 - 29 = 104243340020609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104243340021121.
It is not an unprimeable number, because it can be changed into a prime (104243340021101) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1334070765 + ... + 1334148901.
It is an arithmetic number, because the mean of its divisors is an integer number (1412914757400).
Almost surely, 2104243340021121 is an apocalyptic number.
It is an amenable number.
104243340021121 is a deficient number, since it is larger than the sum of its proper divisors (31396476689279).
104243340021121 is a wasteful number, since it uses less digits than its factorization.
104243340021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78827 (or 78810 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 104243340021121 its reverse (121120043342401), we get a palindrome (225363383363522).
The spelling of 104243340021121 in words is "one hundred four trillion, two hundred forty-three billion, three hundred forty million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •