Base | Representation |
---|---|
bin | 10100010011010001001… |
… | …101000100100000000000 |
3 | 11221100221110202201122120 |
4 | 110103101031010200000 |
5 | 140324110243041402 |
6 | 2544520210204240 |
7 | 202535236060440 |
oct | 24232115044000 |
9 | 4840843681576 |
10 | 1395079268352 |
11 | 498716971820 |
12 | 1a6461283680 |
13 | a172b310643 |
14 | 4b744ca0120 |
15 | 264511653bc |
hex | 144d1344800 |
1395079268352 has 768 divisors, whose sum is σ = 4761217843200. Its totient is φ = 352788480000.
The previous prime is 1395079268339. The next prime is 1395079268371. The reversal of 1395079268352 is 2538629705931.
It is a tau number, because it is divible by the number of its divisors (768).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4214740827 + ... + 4214741157.
It is an arithmetic number, because the mean of its divisors is an integer number (6199502400).
Almost surely, 21395079268352 is an apocalyptic number.
1395079268352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1395079268352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2380608921600).
1395079268352 is an abundant number, since it is smaller than the sum of its proper divisors (3366138574848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1395079268352 is a wasteful number, since it uses less digits than its factorization.
1395079268352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 584 (or 564 counting only the distinct ones).
The product of its (nonzero) digits is 24494400, while the sum is 60.
The spelling of 1395079268352 in words is "one trillion, three hundred ninety-five billion, seventy-nine million, two hundred sixty-eight thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •