Base | Representation |
---|---|
bin | 100111101100011110… |
… | …000101011110101001 |
3 | 11002000101211201110000 |
4 | 213230132011132221 |
5 | 1144242213443101 |
6 | 31325201413213 |
7 | 3036133103400 |
oct | 475436053651 |
9 | 132011751400 |
10 | 42622015401 |
11 | 17092020019 |
12 | 831603a209 |
13 | 4033363074 |
14 | 20c4900637 |
15 | 1196cb5486 |
hex | 9ec7857a9 |
42622015401 has 135 divisors (see below), whose sum is σ = 77391878421. Its totient is φ = 23307492096.
The previous prime is 42622015399. The next prime is 42622015427. The reversal of 42622015401 is 10451022624.
The square root of 42622015401 is 206451.
It is a perfect power (a square), and thus also a powerful number.
42622015401 is a `hidden beast` number, since 4 + 26 + 220 + 15 + 401 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 14707625625 + 27914389776 = 121275^2 + 167076^2 .
It is not a de Polignac number, because 42622015401 - 21 = 42622015399 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 (42622015441) by changing a digit.
It is a polite number, since it can be written in 134 ways as a sum of consecutive naturals, for example, 377185921 + ... + 377186033.
Almost surely, 242622015401 is an apocalyptic number.
42622015401 is the 206451-st square number.
42622015401 is the 103226-th centered octagonal number.
It is an amenable number.
42622015401 is a deficient number, since it is larger than the sum of its proper divisors (34769863020).
42622015401 is an equidigital number, since it uses as much as digits as its factorization.
42622015401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 310 (or 152 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The spelling of 42622015401 in words is "forty-two billion, six hundred twenty-two million, fifteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •