Base | Representation |
---|---|
bin | 10011110010111110011… |
… | …011111100100000111011 |
3 | 11211001102221101020100010 |
4 | 103302332123330200323 |
5 | 134242102043143311 |
6 | 2520543345113003 |
7 | 200200044556551 |
oct | 23627633744073 |
9 | 4731387336303 |
10 | 1360404662331 |
11 | 484a42a6a030 |
12 | 19b7a4928763 |
13 | 9b3936390a0 |
14 | 49bb5a97bd1 |
15 | 255c1e5cda6 |
hex | 13cbe6fc83b |
1360404662331 has 128 divisors (see below), whose sum is σ = 2242187329536. Its totient is φ = 721928148480.
The previous prime is 1360404662329. The next prime is 1360404662459. The reversal of 1360404662331 is 1332664040631.
It is not a de Polignac number, because 1360404662331 - 21 = 1360404662329 is a prime.
It is a super-2 number, since 2×13604046623312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 1360404662331.
It is not an unprimeable number, because it can be changed into a prime (1360404662531) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 713373280 + ... + 713375186.
It is an arithmetic number, because the mean of its divisors is an integer number (17517088512).
Almost surely, 21360404662331 is an apocalyptic number.
1360404662331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1360404662331 is a deficient number, since it is larger than the sum of its proper divisors (881782667205).
1360404662331 is a wasteful number, since it uses less digits than its factorization.
1360404662331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2521.
The product of its (nonzero) digits is 186624, while the sum is 39.
The spelling of 1360404662331 in words is "one trillion, three hundred sixty billion, four hundred four million, six hundred sixty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •