Base | Representation |
---|---|
bin | 110001000111001110101111… |
… | …010111110001000100100110 |
3 | 1001022210111201000021012122220 |
4 | 301013032233113301010212 |
5 | 211302430314441314441 |
6 | 2043221315513533210 |
7 | 63332365446545520 |
oct | 6107165727610446 |
9 | 1038714630235586 |
10 | 216001142526246 |
11 | 6290862a8aa690 |
12 | 20286575714206 |
13 | 936aa8839750c |
14 | 3b4a722590a10 |
15 | 19e8a43401466 |
hex | c473af5f1126 |
216001142526246 has 64 divisors (see below), whose sum is σ = 538698131767296. Its totient is φ = 56093997002400.
The previous prime is 216001142526241. The next prime is 216001142526271. The reversal of 216001142526246 is 642625241100612.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 216001142526198 and 216001142526207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (216001142526241) 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, 39937620 + ... + 45022391.
It is an arithmetic number, because the mean of its divisors is an integer number (8417158308864).
Almost surely, 2216001142526246 is an apocalyptic number.
216001142526246 is an abundant number, since it is smaller than the sum of its proper divisors (322696989241050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
216001142526246 is a wasteful number, since it uses less digits than its factorization.
216001142526246 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84965537.
The product of its (nonzero) digits is 276480, while the sum is 42.
Adding to 216001142526246 its reverse (642625241100612), we get a palindrome (858626383626858).
The spelling of 216001142526246 in words is "two hundred sixteen trillion, one billion, one hundred forty-two million, five hundred twenty-six thousand, two hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •