Base | Representation |
---|---|
bin | 10011110000111010000… |
… | …100101110001110010010 |
3 | 11210211201011202222120100 |
4 | 103300322010232032102 |
5 | 134223030044410340 |
6 | 2515535140153230 |
7 | 200061031236024 |
oct | 23607204561622 |
9 | 4724634688510 |
10 | 1358183981970 |
11 | 4840034a5002 |
12 | 19b285098816 |
13 | 9b0cb54673a |
14 | 49a44b96014 |
15 | 254e2008830 |
hex | 13c3a12e392 |
1358183981970 has 96 divisors (see below), whose sum is σ = 3750298081920. Its totient is φ = 339847580160.
The previous prime is 1358183981933. The next prime is 1358183982047. The reversal of 1358183981970 is 791893818531.
1358183981970 is a `hidden beast` number, since 1 + 3 + 58 + 1 + 8 + 398 + 197 + 0 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 1358183981898 and 1358183981907.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 834510 + ... + 1847369.
It is an arithmetic number, because the mean of its divisors is an integer number (39065605020).
Almost surely, 21358183981970 is an apocalyptic number.
1358183981970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1358183981970 is an abundant number, since it is smaller than the sum of its proper divisors (2392114099950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1358183981970 is a wasteful number, since it uses less digits than its factorization.
1358183981970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2682240 (or 2682237 counting only the distinct ones).
The product of its (nonzero) digits is 13063680, while the sum is 63.
The spelling of 1358183981970 in words is "one trillion, three hundred fifty-eight billion, one hundred eighty-three million, nine hundred eighty-one thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •