Base | Representation |
---|---|
bin | 101110110101110001100100… |
… | …1010011100001110010000111 |
3 | 2000000210212101222222201100201 |
4 | 1131223203021103201302013 |
5 | 413000342012012011330 |
6 | 4020135123535351331 |
7 | 152532545445230122 |
oct | 13553431123416207 |
9 | 2000725358881321 |
10 | 412011000110215 |
11 | 10a30897a504080 |
12 | 3a2625aa382547 |
13 | 148b8616ba319c |
14 | 73a56201253b9 |
15 | 3297541b10eca |
hex | 176b8c94e1c87 |
412011000110215 has 32 divisors (see below), whose sum is σ = 568503204848640. Its totient is φ = 283495613040000.
The previous prime is 412011000110159. The next prime is 412011000110233. The reversal of 412011000110215 is 512011000110214.
It is not a de Polignac number, because 412011000110215 - 215 = 412011000077447 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 412011000110192 and 412011000110201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 261711144 + ... + 263280733.
It is an arithmetic number, because the mean of its divisors is an integer number (17765725151520).
Almost surely, 2412011000110215 is an apocalyptic number.
412011000110215 is a deficient number, since it is larger than the sum of its proper divisors (156492204738425).
412011000110215 is a wasteful number, since it uses less digits than its factorization.
412011000110215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 524992663.
The product of its (nonzero) digits is 80, while the sum is 19.
Adding to 412011000110215 its reverse (512011000110214), we get a palindrome (924022000220429).
Subtracting 412011000110215 from its reverse (512011000110214), we obtain a palindrome (99999999999999).
The spelling of 412011000110215 in words is "four hundred twelve trillion, eleven billion, one hundred ten thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •