Base | Representation |
---|---|
bin | 110000011100011110100010… |
… | …100101111011110101010001 |
3 | 1000221101122021200120210021200 |
4 | 300130132202211323311101 |
5 | 210411311333122143230 |
6 | 2033051511433141413 |
7 | 62610206662453635 |
oct | 6034364245736521 |
9 | 1027348250523250 |
10 | 213063170506065 |
11 | 61985646229250 |
12 | 1ba910a085a869 |
13 | 91b6a034b7469 |
14 | 3a8845360adc5 |
15 | 19973de49d160 |
hex | c1c7a297bd51 |
213063170506065 has 24 divisors (see below), whose sum is σ = 402883086048768. Its totient is φ = 103303355396640.
The previous prime is 213063170506031. The next prime is 213063170506171. The reversal of 213063170506065 is 560605071360312.
213063170506065 is a `hidden beast` number, since 2 + 1 + 3 + 0 + 6 + 31 + 7 + 0 + 5 + 0 + 606 + 5 = 666.
It is not a de Polignac number, because 213063170506065 - 210 = 213063170505041 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 213063170506065.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 215215323249 + ... + 215215324238.
It is an arithmetic number, because the mean of its divisors is an integer number (16786795252032).
Almost surely, 2213063170506065 is an apocalyptic number.
It is an amenable number.
213063170506065 is a deficient number, since it is larger than the sum of its proper divisors (189819915542703).
213063170506065 is a wasteful number, since it uses less digits than its factorization.
213063170506065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430430647509 (or 430430647506 counting only the distinct ones).
The product of its (nonzero) digits is 680400, while the sum is 45.
The spelling of 213063170506065 in words is "two hundred thirteen trillion, sixty-three billion, one hundred seventy million, five hundred six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •