Base | Representation |
---|---|
bin | 10001011101100111111… |
… | …110100110101101101011 |
3 | 11020201111212121121111210 |
4 | 101131213332212231223 |
5 | 124130140311342311 |
6 | 2315142501124203 |
7 | 152462055406230 |
oct | 21354776465553 |
9 | 4221455547453 |
10 | 1200040340331 |
11 | 422a3053a408 |
12 | 1746ab0b9663 |
13 | 89217a70421 |
14 | 42121a29787 |
15 | 213385083a6 |
hex | 11767fa6b6b |
1200040340331 has 32 divisors (see below), whose sum is σ = 1838060032000. Its totient is φ = 682203060000.
The previous prime is 1200040340293. The next prime is 1200040340371. The reversal of 1200040340331 is 1330430400021.
It is not a de Polignac number, because 1200040340331 - 215 = 1200040307563 is a prime.
It is a super-2 number, since 2×12000403403312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1200040340298 and 1200040340307.
It is not an unprimeable number, because it can be changed into a prime (1200040340371) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45700956 + ... + 45727206.
It is an arithmetic number, because the mean of its divisors is an integer number (57439376000).
Almost surely, 21200040340331 is an apocalyptic number.
1200040340331 is a deficient number, since it is larger than the sum of its proper divisors (638019691669).
1200040340331 is a wasteful number, since it uses less digits than its factorization.
1200040340331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37399.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 1200040340331 its reverse (1330430400021), we get a palindrome (2530470740352).
The spelling of 1200040340331 in words is "one trillion, two hundred billion, forty million, three hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •