Base | Representation |
---|---|
bin | 10111101100011110100001… |
… | …101111111111000000000101 |
3 | 111122222112002222101022111202 |
4 | 113230132201233333000011 |
5 | 102124400130313312240 |
6 | 1005350034331312245 |
7 | 30644014150614620 |
oct | 2754364157770005 |
9 | 448875088338452 |
10 | 104211505213445 |
11 | 3022893a9a5103 |
12 | b830a7a2ab685 |
13 | 461c144a47246 |
14 | 1ba3c14254db7 |
15 | c0aba8cd6315 |
hex | 5ec7a1bff005 |
104211505213445 has 16 divisors (see below), whose sum is σ = 143244190721280. Its totient is φ = 71296540360704.
The previous prime is 104211505213441. The next prime is 104211505213483. The reversal of 104211505213445 is 544312505112401.
It is a cyclic number.
It is not a de Polignac number, because 104211505213445 - 22 = 104211505213441 is a prime.
It is a super-3 number, since 3×1042115052134453 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104211505213399 and 104211505213408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104211505213441) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3391182332 + ... + 3391213061.
It is an arithmetic number, because the mean of its divisors is an integer number (8952761920080).
Almost surely, 2104211505213445 is an apocalyptic number.
It is an amenable number.
104211505213445 is a deficient number, since it is larger than the sum of its proper divisors (39032685507835).
104211505213445 is an equidigital number, since it uses as much as digits as its factorization.
104211505213445 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6782395844.
The product of its (nonzero) digits is 96000, while the sum is 38.
The spelling of 104211505213445 in words is "one hundred four trillion, two hundred eleven billion, five hundred five million, two hundred thirteen thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •