Base | Representation |
---|---|
bin | 101111111111010010… |
… | …0011100011101100011 |
3 | 100212000002120022112220 |
4 | 1133332210130131203 |
5 | 3142024113330220 |
6 | 115202022522123 |
7 | 10305542604135 |
oct | 1377644343543 |
9 | 325002508486 |
10 | 103055214435 |
11 | 3a783a88a08 |
12 | 17b80b96343 |
13 | 9944786934 |
14 | 4db8b1b055 |
15 | 2a32588540 |
hex | 17fe91c763 |
103055214435 has 32 divisors (see below), whose sum is σ = 165192867840. Its totient is φ = 54861383808.
The previous prime is 103055214359. The next prime is 103055214469. The reversal of 103055214435 is 534412550301.
It is not a de Polignac number, because 103055214435 - 212 = 103055210339 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103055214396 and 103055214405.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23297634 + ... + 23302056.
It is an arithmetic number, because the mean of its divisors is an integer number (5162277120).
Almost surely, 2103055214435 is an apocalyptic number.
103055214435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
103055214435 is a deficient number, since it is larger than the sum of its proper divisors (62137653405).
103055214435 is a wasteful number, since it uses less digits than its factorization.
103055214435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6947.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 103055214435 its reverse (534412550301), we get a palindrome (637467764736).
The spelling of 103055214435 in words is "one hundred three billion, fifty-five million, two hundred fourteen thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •