Base | Representation |
---|---|
bin | 110000100010000110… |
… | …1001001000111111000 |
3 | 100222000111220221012020 |
4 | 1201010031021013320 |
5 | 3201422204323112 |
6 | 115513555314440 |
7 | 10346520140514 |
oct | 1410415110770 |
9 | 328014827166 |
10 | 104223511032 |
11 | 40223500493 |
12 | 182482aba20 |
13 | 9a9c82a9b4 |
14 | 5089d57144 |
15 | 2a9ee1048c |
hex | 18443491f8 |
104223511032 has 16 divisors (see below), whose sum is σ = 260558777640. Its totient is φ = 34741170336.
The previous prime is 104223511027. The next prime is 104223511169. The reversal of 104223511032 is 230115322401.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 4342646293 = 104223511032 / (1 + 0 + 4 + 2 + 2 + 3 + 5 + 1 + 1 + 0 + 3 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 104223510993 and 104223511011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2171323123 + ... + 2171323170.
Almost surely, 2104223511032 is an apocalyptic number.
104223511032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
104223511032 is an abundant number, since it is smaller than the sum of its proper divisors (156335266608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104223511032 is a wasteful number, since it uses less digits than its factorization.
104223511032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4342646302 (or 4342646298 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 104223511032 its reverse (230115322401), we get a palindrome (334338833433).
The spelling of 104223511032 in words is "one hundred four billion, two hundred twenty-three million, five hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •