Base | Representation |
---|---|
bin | 10001100001010100001… |
… | …000011011111000110001 |
3 | 11021002201222211001212010 |
4 | 101201110020123320301 |
5 | 124211244044343101 |
6 | 2321035552353133 |
7 | 152662205014650 |
oct | 21412410337061 |
9 | 4232658731763 |
10 | 1204002340401 |
11 | 424683a29733 |
12 | 175415b457a9 |
13 | 896c9848773 |
14 | 423b9ccb197 |
15 | 214bb2742d6 |
hex | 1185421be31 |
1204002340401 has 32 divisors (see below), whose sum is σ = 1837773100800. Its totient is φ = 686838297600.
The previous prime is 1204002340397. The next prime is 1204002340417. The reversal of 1204002340401 is 1040432004021.
It is not a de Polignac number, because 1204002340401 - 22 = 1204002340397 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (1204002340201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 71962605 + ... + 71979333.
It is an arithmetic number, because the mean of its divisors is an integer number (57430409400).
Almost surely, 21204002340401 is an apocalyptic number.
It is an amenable number.
1204002340401 is a deficient number, since it is larger than the sum of its proper divisors (633770760399).
1204002340401 is a wasteful number, since it uses less digits than its factorization.
1204002340401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22329.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 1204002340401 its reverse (1040432004021), we get a palindrome (2244434344422).
It can be divided in two parts, 1204002 and 340401, that added together give a triangular number (1544403 = T1757).
The spelling of 1204002340401 in words is "one trillion, two hundred four billion, two million, three hundred forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •