Base | Representation |
---|---|
bin | 110000001010100011… |
… | …0111001000111001000 |
3 | 100212222110002021000120 |
4 | 1200111012321013020 |
5 | 3143312413442212 |
6 | 115303331303240 |
7 | 10321113625056 |
oct | 1402506710710 |
9 | 325873067016 |
10 | 103433343432 |
11 | 3a958475911 |
12 | 1806774ab20 |
13 | 99a4c0b2c3 |
14 | 501302b1d6 |
15 | 2a5587b88c |
hex | 18151b91c8 |
103433343432 has 32 divisors (see below), whose sum is σ = 259465913280. Its totient is φ = 34360107200.
The previous prime is 103433343421. The next prime is 103433343473. The reversal of 103433343432 is 234343334301.
It is a super-3 number, since 3×1034333434323 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103433343393 and 103433343402.
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, 7347444 + ... + 7361507.
It is an arithmetic number, because the mean of its divisors is an integer number (8108309790).
Almost surely, 2103433343432 is an apocalyptic number.
103433343432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103433343432 is an abundant number, since it is smaller than the sum of its proper divisors (156032569848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103433343432 is a wasteful number, since it uses less digits than its factorization.
103433343432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14709253 (or 14709249 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 33.
Adding to 103433343432 its reverse (234343334301), we get a palindrome (337776677733).
The spelling of 103433343432 in words is "one hundred three billion, four hundred thirty-three million, three hundred forty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •