Base | Representation |
---|---|
bin | 11100101011010011010110… |
… | …11101000010100000000001 |
3 | 22021021112012112211002221010 |
4 | 32111221223131002200001 |
5 | 31231140412212130101 |
6 | 342041333301151133 |
7 | 16165654201063041 |
oct | 1625515335024001 |
9 | 267245175732833 |
10 | 63060512614401 |
11 | 191028a4428705 |
12 | 70a56720bb4a9 |
13 | 29257720b91b3 |
14 | 11802061dd721 |
15 | 745536a552d6 |
hex | 395a6b742801 |
63060512614401 has 8 divisors (see below), whose sum is σ = 84302532256480. Its totient is φ = 41929417357632.
The previous prime is 63060512614373. The next prime is 63060512614433. The reversal of 63060512614401 is 10441621506036.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 63060512614401 - 222 = 63060508420097 is a prime.
It is a super-2 number, since 2×630605126144012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 63060512614401.
It is not an unprimeable number, because it can be changed into a prime (63060512614901) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27731095000 + ... + 27731097273.
It is an arithmetic number, because the mean of its divisors is an integer number (10537816532060).
Almost surely, 263060512614401 is an apocalyptic number.
It is an amenable number.
63060512614401 is a deficient number, since it is larger than the sum of its proper divisors (21242019642079).
63060512614401 is a wasteful number, since it uses less digits than its factorization.
63060512614401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55462192655.
The product of its (nonzero) digits is 103680, while the sum is 39.
The spelling of 63060512614401 in words is "sixty-three trillion, sixty billion, five hundred twelve million, six hundred fourteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •