Base | Representation |
---|---|
bin | 111011101110010110001… |
… | …110101110111101010001 |
3 | 112112100200202010012211211 |
4 | 323232112032232331101 |
5 | 1014220412314244213 |
6 | 12421241110140121 |
7 | 602343153125206 |
oct | 73562616567521 |
9 | 15470622105754 |
10 | 4104214212433 |
11 | 1342650a20965 |
12 | 563511051641 |
13 | 23a04471bbaa |
14 | 102905d55cad |
15 | 71b6018053d |
hex | 3bb963aef51 |
4104214212433 has 2 divisors, whose sum is σ = 4104214212434. Its totient is φ = 4104214212432.
The previous prime is 4104214212419. The next prime is 4104214212437. The reversal of 4104214212433 is 3342124124014.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3077329909824 + 1026884302609 = 1754232^2 + 1013353^2 .
It is a cyclic number.
It is not a de Polignac number, because 4104214212433 - 229 = 4103677341521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4104214212395 and 4104214212404.
It is not a weakly prime, because it can be changed into another prime (4104214212437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2052107106216 + 2052107106217.
It is an arithmetic number, because the mean of its divisors is an integer number (2052107106217).
Almost surely, 24104214212433 is an apocalyptic number.
It is an amenable number.
4104214212433 is a deficient number, since it is larger than the sum of its proper divisors (1).
4104214212433 is an equidigital number, since it uses as much as digits as its factorization.
4104214212433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 4104214212433 its reverse (3342124124014), we get a palindrome (7446338336447).
The spelling of 4104214212433 in words is "four trillion, one hundred four billion, two hundred fourteen million, two hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •