Base | Representation |
---|---|
bin | 11111010010001001011… |
… | …11110100111001100011 |
3 | 10210202111021222101222122 |
4 | 33221010233310321203 |
5 | 120102341133242011 |
6 | 2141444450454455 |
7 | 140441622360116 |
oct | 17510457647143 |
9 | 3722437871878 |
10 | 1074895212131 |
11 | 384951363324 |
12 | 1543a429442b |
13 | 7a492942c00 |
14 | 3a04d24457d |
15 | 1ce619d03db |
hex | fa44bf4e63 |
1074895212131 has 36 divisors (see below), whose sum is σ = 1218202047936. Its totient is φ = 947026080000.
The previous prime is 1074895212101. The next prime is 1074895212137. The reversal of 1074895212131 is 1312125984701.
It is not a de Polignac number, because 1074895212131 - 26 = 1074895212067 is a prime.
It is a super-2 number, since 2×10748952121312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1074895212137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 27899381 + ... + 27937881.
It is an arithmetic number, because the mean of its divisors is an integer number (33838945776).
Almost surely, 21074895212131 is an apocalyptic number.
1074895212131 is a deficient number, since it is larger than the sum of its proper divisors (143306835805).
1074895212131 is an equidigital number, since it uses as much as digits as its factorization.
1074895212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38704 (or 38618 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 44.
The spelling of 1074895212131 in words is "one trillion, seventy-four billion, eight hundred ninety-five million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •