Base | Representation |
---|---|
bin | 101011010000110001001101… |
… | …1010101111101000010001100 |
3 | 1211220100221202111210220120220 |
4 | 1112201202123111331002030 |
5 | 344334203134403232400 |
6 | 3425200052305511340 |
7 | 143103604246060503 |
oct | 12641423325750214 |
9 | 1756327674726526 |
10 | 380536708649100 |
11 | 100283791508493 |
12 | 3681a691942550 |
13 | 134445c45c2a33 |
14 | 69d8109a1383a |
15 | 2ded97696c7a0 |
hex | 15a189b57d08c |
380536708649100 has 72 divisors (see below), whose sum is σ = 1101390135144768. Its totient is φ = 101442299745600.
The previous prime is 380536708649033. The next prime is 380536708649117. The reversal of 380536708649100 is 1946807635083.
It is a Harshad number since it is a multiple of its sum of digits (60).
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 23 ways as a sum of consecutive naturals, for example, 212581554 + ... + 214364153.
It is an arithmetic number, because the mean of its divisors is an integer number (15297085210344).
Almost surely, 2380536708649100 is an apocalyptic number.
380536708649100 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
380536708649100 is an abundant number, since it is smaller than the sum of its proper divisors (720853426495668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
380536708649100 is a wasteful number, since it uses less digits than its factorization.
380536708649100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426948695 (or 426948688 counting only the distinct ones).
The product of its (nonzero) digits is 26127360, while the sum is 60.
The spelling of 380536708649100 in words is "three hundred eighty trillion, five hundred thirty-six billion, seven hundred eight million, six hundred forty-nine thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •