Base | Representation |
---|---|
bin | 10010011111000100011… |
… | …000011101110011000100 |
3 | 11111102220002120021022022 |
4 | 102133010120131303010 |
5 | 131303043341201124 |
6 | 2411323350022312 |
7 | 160530316456550 |
oct | 22370430356304 |
9 | 4442802507268 |
10 | 1270310100164 |
11 | 44a80aa30a96 |
12 | 186240347998 |
13 | 92a36058481 |
14 | 456aa3c2860 |
15 | 2309c652c5e |
hex | 127c461dcc4 |
1270310100164 has 24 divisors (see below), whose sum is σ = 2540704826688. Its totient is φ = 544400480160.
The previous prime is 1270310100151. The next prime is 1270310100173. The reversal of 1270310100164 is 4610010130721.
It is a super-2 number, since 2×12703101001642 (a number of 25 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 117734 + ... + 1598274.
It is an arithmetic number, because the mean of its divisors is an integer number (105862701112).
Almost surely, 21270310100164 is an apocalyptic number.
1270310100164 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1270310100164 is an abundant number, since it is smaller than the sum of its proper divisors (1270394726524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1270310100164 is a wasteful number, since it uses less digits than its factorization.
1270310100164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1511195 (or 1511193 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 26.
Adding to 1270310100164 its reverse (4610010130721), we get a palindrome (5880320230885).
The spelling of 1270310100164 in words is "one trillion, two hundred seventy billion, three hundred ten million, one hundred thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •