Base | Representation |
---|---|
bin | 101001001011001… |
… | …0111110011111000 |
3 | 10120021201100222100 |
4 | 1102112113303320 |
5 | 10312142041113 |
6 | 345032223400 |
7 | 46144242603 |
oct | 12226276370 |
9 | 3507640870 |
10 | 1381596408 |
11 | 649969915 |
12 | 32683ab60 |
13 | 190306b8a |
14 | d16c133a |
15 | 8145bd73 |
hex | 52597cf8 |
1381596408 has 24 divisors (see below), whose sum is σ = 3741823800. Its totient is φ = 460532112.
The previous prime is 1381596383. The next prime is 1381596413. The reversal of 1381596408 is 8046951831.
1381596408 is a `hidden beast` number, since 13 + 8 + 1 + 596 + 40 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 9594348 + ... + 9594491.
It is an arithmetic number, because the mean of its divisors is an integer number (155909325).
Almost surely, 21381596408 is an apocalyptic number.
1381596408 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1381596408 is an abundant number, since it is smaller than the sum of its proper divisors (2360227392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1381596408 is a wasteful number, since it uses less digits than its factorization.
1381596408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19188851 (or 19188844 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 45.
The square root of 1381596408 is about 37169.8319608792. The cubic root of 1381596408 is about 1113.7654250075.
The spelling of 1381596408 in words is "one billion, three hundred eighty-one million, five hundred ninety-six thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •