Base | Representation |
---|---|
bin | 101111110001011010111111… |
… | …011100100110011011010101 |
3 | 1000112220210020102112012112102 |
4 | 233301122333130212123111 |
5 | 210014322324031201123 |
6 | 2022504350011131445 |
7 | 62153354305313045 |
oct | 5761327734463325 |
9 | 1015823212465472 |
10 | 210104422131413 |
11 | 60a4486a978227 |
12 | 1b693789a43b85 |
13 | 90309ba138434 |
14 | 39c517320d725 |
15 | 1945471578028 |
hex | bf16bf7266d5 |
210104422131413 has 16 divisors (see below), whose sum is σ = 230147241900480. Its totient is φ = 190916096345856.
The previous prime is 210104422131353. The next prime is 210104422131427. The reversal of 210104422131413 is 314131224401012.
It is a cyclic number.
It is not a de Polignac number, because 210104422131413 - 26 = 210104422131349 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210104422131473) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2614331 + ... + 20665032.
It is an arithmetic number, because the mean of its divisors is an integer number (14384202618780).
Almost surely, 2210104422131413 is an apocalyptic number.
It is an amenable number.
210104422131413 is a deficient number, since it is larger than the sum of its proper divisors (20042819769067).
210104422131413 is a wasteful number, since it uses less digits than its factorization.
210104422131413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23297716.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 210104422131413 its reverse (314131224401012), we get a palindrome (524235646532425).
The spelling of 210104422131413 in words is "two hundred ten trillion, one hundred four billion, four hundred twenty-two million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •