Base | Representation |
---|---|
bin | 10111111000011101101111… |
… | …111100110011011111011000 |
3 | 111202220021110220001221002220 |
4 | 113320131233330303133120 |
5 | 102231344300134343300 |
6 | 1011220315142224040 |
7 | 31060356510142506 |
oct | 2770355774633730 |
9 | 452807426057086 |
10 | 105035303434200 |
11 | 30516249584337 |
12 | b944666725020 |
13 | 467ba2c261b39 |
14 | 1bd1a430cd676 |
15 | c2232150cda0 |
hex | 5f876ff337d8 |
105035303434200 has 96 divisors (see below), whose sum is σ = 325705525275600. Its totient is φ = 28001148904960.
The previous prime is 105035303434177. The next prime is 105035303434231. The reversal of 105035303434200 is 2434303530501.
It is a super-2 number, since 2×1050353034342002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23794107 + ... + 27860906.
Almost surely, 2105035303434200 is an apocalyptic number.
105035303434200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105035303434200 is an abundant number, since it is smaller than the sum of its proper divisors (220670221841400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105035303434200 is a wasteful number, since it uses less digits than its factorization.
105035303434200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51658421 (or 51658412 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 33.
Adding to 105035303434200 its reverse (2434303530501), we get a palindrome (107469606964701).
The spelling of 105035303434200 in words is "one hundred five trillion, thirty-five billion, three hundred three million, four hundred thirty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •