Base | Representation |
---|---|
bin | 10100000000110110000… |
… | …110101111001010111100 |
3 | 11212110212211110010001222 |
4 | 110000312012233022330 |
5 | 140013102100123320 |
6 | 2531445225252512 |
7 | 201235101626261 |
oct | 24006606571274 |
9 | 4773784403058 |
10 | 1375297270460 |
11 | 490295500a33 |
12 | 1a2660334138 |
13 | 9c8c7b53c49 |
14 | 4a7c9925268 |
15 | 25b9460c825 |
hex | 140361af2bc |
1375297270460 has 12 divisors (see below), whose sum is σ = 2888124268008. Its totient is φ = 550118908176.
The previous prime is 1375297270411. The next prime is 1375297270481. The reversal of 1375297270460 is 640727925731.
It is a super-2 number, since 2×13752972704602 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 34382431742 + ... + 34382431781.
It is an arithmetic number, because the mean of its divisors is an integer number (240677022334).
Almost surely, 21375297270460 is an apocalyptic number.
1375297270460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1375297270460 is an abundant number, since it is smaller than the sum of its proper divisors (1512826997548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1375297270460 is a wasteful number, since it uses less digits than its factorization.
1375297270460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68764863532 (or 68764863530 counting only the distinct ones).
The product of its (nonzero) digits is 4445280, while the sum is 53.
The spelling of 1375297270460 in words is "one trillion, three hundred seventy-five billion, two hundred ninety-seven million, two hundred seventy thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •