Base | Representation |
---|---|
bin | 10111110000001000000001… |
… | …000110010010101111011011 |
3 | 111200212111020020022110110121 |
4 | 113300020001012102233123 |
5 | 102143002103012001110 |
6 | 1010101140025254111 |
7 | 31001101006626523 |
oct | 2760100106225733 |
9 | 450774206273417 |
10 | 104462213000155 |
11 | 303151a2a06a4a |
12 | b871587934337 |
13 | 463998a64082a |
14 | 1bb1dd8a6a683 |
15 | c1247dd0ecda |
hex | 5f0201192bdb |
104462213000155 has 8 divisors (see below), whose sum is σ = 127225620609552. Its totient is φ = 82322460393888.
The previous prime is 104462213000149. The next prime is 104462213000179. The reversal of 104462213000155 is 551000312264401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104462213000155 - 223 = 104462204611547 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 104462213000155.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 155913750412 + ... + 155913751081.
It is an arithmetic number, because the mean of its divisors is an integer number (15903202576194).
Almost surely, 2104462213000155 is an apocalyptic number.
104462213000155 is a deficient number, since it is larger than the sum of its proper divisors (22763407609397).
104462213000155 is an equidigital number, since it uses as much as digits as its factorization.
104462213000155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311827501565.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 104462213000155 its reverse (551000312264401), we get a palindrome (655462525264556).
The spelling of 104462213000155 in words is "one hundred four trillion, four hundred sixty-two billion, two hundred thirteen million, one hundred fifty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •