Base | Representation |
---|---|
bin | 10100010011100110101… |
… | …110000100010110100000 |
3 | 11221101212121222222201001 |
4 | 110103212232010112200 |
5 | 140330330200140112 |
6 | 2545020103121344 |
7 | 202550211222136 |
oct | 24234656042640 |
9 | 4841777888631 |
10 | 1395440240032 |
11 | 498891700123 |
12 | 1a6542143254 |
13 | a1788038757 |
14 | 4b77abc5756 |
15 | 26472bb9c57 |
hex | 144e6b845a0 |
1395440240032 has 48 divisors (see below), whose sum is σ = 2896273582272. Its totient is φ = 660504176640.
The previous prime is 1395440239987. The next prime is 1395440240057. The reversal of 1395440240032 is 2300420445931.
It is a super-2 number, since 2×13954402400322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1395440239973 and 1395440240000.
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 7 ways as a sum of consecutive naturals, for example, 9701694 + ... + 9844477.
It is an arithmetic number, because the mean of its divisors is an integer number (60339032964).
Almost surely, 21395440240032 is an apocalyptic number.
It is an amenable number.
1395440240032 is an abundant number, since it is smaller than the sum of its proper divisors (1500833342240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1395440240032 is a wasteful number, since it uses less digits than its factorization.
1395440240032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19546301 (or 19546293 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 37.
Adding to 1395440240032 its reverse (2300420445931), we get a palindrome (3695860685963).
The spelling of 1395440240032 in words is "one trillion, three hundred ninety-five billion, four hundred forty million, two hundred forty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •