Base | Representation |
---|---|
bin | 10100011000111110000… |
… | …011010101110000011001 |
3 | 11221221202001202111200012 |
4 | 110120332003111300121 |
5 | 140424124300321213 |
6 | 2551411431251305 |
7 | 203143023616460 |
oct | 24307603256031 |
9 | 4857661674605 |
10 | 1401200401433 |
11 | 4a0278108698 |
12 | 1a768b219b35 |
13 | a219550bc91 |
14 | 4bb65c019d7 |
15 | 266ad7294a8 |
hex | 1463e0d5c19 |
1401200401433 has 8 divisors (see below), whose sum is σ = 1602403047168. Its totient is φ = 1200255545664.
The previous prime is 1401200401399. The next prime is 1401200401441. The reversal of 1401200401433 is 3341040021041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1401200401433 - 26 = 1401200401369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1401200401399 and 1401200401408.
It is not an unprimeable number, because it can be changed into a prime (1401200401463) by changing a digit.
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, 64435841 + ... + 64457582.
It is an arithmetic number, because the mean of its divisors is an integer number (200300380896).
Almost surely, 21401200401433 is an apocalyptic number.
It is an amenable number.
1401200401433 is a deficient number, since it is larger than the sum of its proper divisors (201202645735).
1401200401433 is a wasteful number, since it uses less digits than its factorization.
1401200401433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128894983.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1401200401433 its reverse (3341040021041), we get a palindrome (4742240422474).
The spelling of 1401200401433 in words is "one trillion, four hundred one billion, two hundred million, four hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •