Base | Representation |
---|---|
bin | 11100101111010111110110… |
… | …00100010011000110111001 |
3 | 22021202220011211020020202000 |
4 | 32113223323010103012321 |
5 | 31240433314404021101 |
6 | 342225502305331213 |
7 | 16212034601543661 |
oct | 1627537304230671 |
9 | 267686154206660 |
10 | 63200361001401 |
11 | 19157139178748 |
12 | 71087a1036b09 |
13 | 29359cb436050 |
14 | 1186cb16431a1 |
15 | 748ebe2c9486 |
hex | 397afb1131b9 |
63200361001401 has 32 divisors (see below), whose sum is σ = 102047334049920. Its totient is φ = 38423945132352.
The previous prime is 63200361001361. The next prime is 63200361001403. The reversal of 63200361001401 is 10410016300236.
63200361001401 is a `hidden beast` number, since 6 + 3 + 2 + 0 + 0 + 3 + 610 + 0 + 1 + 40 + 1 = 666.
It is not a de Polignac number, because 63200361001401 - 27 = 63200361001273 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (63200361001403) 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, 1084657666 + ... + 1084715931.
It is an arithmetic number, because the mean of its divisors is an integer number (3188979189060).
Almost surely, 263200361001401 is an apocalyptic number.
It is an amenable number.
63200361001401 is a deficient number, since it is larger than the sum of its proper divisors (38846973048519).
63200361001401 is a wasteful number, since it uses less digits than its factorization.
63200361001401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2169373702 (or 2169373696 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 63200361001401 its reverse (10410016300236), we get a palindrome (73610377301637).
The spelling of 63200361001401 in words is "sixty-three trillion, two hundred billion, three hundred sixty-one million, one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •